Rank of adjacency matrices of directed (strongly) regular graphs
Let \(B_r\) be the set of all values of \(k/n\) for which there exists an \(n\times n\) matrix with entries \(0\) and \(1\) such that each row and each column has exactly \(k\) 1's and the matrix has rank~\(r\). First, it is shown that \(B_r\) is finite for every \(r\) by showing that \(| B_r| <2^{r^2}\), and also a lower bound is given \(| B_r| \geq 2^{r-1}-1\). Further, the sets \(B_r\) are explicitly determined for \(1\leq r\leq 7\). In the second part of the paper, the properties of \(B_r\) are applied to directed strongly regular graphs. A directed strongly regular graph with parameters \((n,k,\mu,\lambda,t)\) is a \(k\)-regular directed graph on \(n\) vertices such that every vertex is incident with \(t\) undirected edges, and the number of paths of length 2 from a vertex \(x\) to a vertex \(y\) is \(\lambda\) if there is an edge directed from \(x\) to \(y\) and it is \(\mu\) otherwise. It is shown that there exists no directed strongly regular graph with the parameter set \((n,k,\mu,\lambda,t)\) and the rank of adjacency matrix \(r\) if \(1-\frac{3}{2r} < \frac{k}{n} \leq 1-\frac{1}{r}\).
- A directed graph version of strongly regular graphs
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- scientific article; zbMATH DE number 3639629 (Why is no real title available?)
- scientific article; zbMATH DE number 1355278 (Why is no real title available?)
- Non-existence of directed strongly regular graphs
- Non-singular 0-1 matrices with constant row and column sums
- On Representatives of Subsets
- On the minimum rank of regular classes of matrices of zeros and ones
- Small vertex-transitive directed strongly regular graphs
- Ranks of matrices with few distinct entries
- On the characterization of digraphs with given rank
- Rank of incidence matrix with applications to digraph reconstruction
- Directed strongly regular graphs with rank 5
- Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
- Directed strongly regular graphs with rank 6
- New mixed Moore graphs and directed strongly regular graphs
- Further results on the minimum rank of regular classes of (0,1)-matrices
- Partial sum quadruples and bi-abelian digraphs
- Nonexistence of square roots of directed strongly regular graphs
- scientific article; zbMATH DE number 5494051 (Why is no real title available?)
- Directed strongly regular graphs and their codes
- Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs
- Construction of directed strongly regular graphs as generalized Cayley graphs
- Codes arising from directed strongly regular graphs with =1
This page was built for publication: Rank of adjacency matrices of directed (strongly) regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568399)
