Rank of adjacency matrices of directed (strongly) regular graphs
From MaRDI portal
Publication:2568399
DOI10.1016/j.laa.2005.05.005zbMath1074.05060OpenAlexW2095538168MaRDI QIDQ2568399
Publication date: 10 October 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://vbn.aau.dk/ws/files/113262/abstractfil2.pdf
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (7)
Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd ⋮ Further results on the minimum rank of regular classes of \((0,1)\)-matrices ⋮ Directed strongly regular graphs with rank 6 ⋮ On the characterization of digraphs with given rank ⋮ New mixed Moore graphs and directed strongly regular graphs ⋮ Partial sum quadruples and bi-abelian digraphs ⋮ Directed strongly regular graphs with rank 5
Cites Work
- Unnamed Item
- Unnamed Item
- On the minimum rank of regular classes of matrices of zeros and ones
- A directed graph version of strongly regular graphs
- Non-singular 0-1 matrices with constant row and column sums
- Small vertex-transitive directed strongly regular graphs
- Non-existence of directed strongly regular graphs
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- On Representatives of Subsets
This page was built for publication: Rank of adjacency matrices of directed (strongly) regular graphs