Degree of indecomposability of certain highly regular zero-one matrices
DOI10.1016/0024-3795(95)00111-5zbMath0864.15008OpenAlexW2015760902WikidataQ56850766 ScholiaQ56850766MaRDI QIDQ2564950
Publication date: 22 June 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(95)00111-5
symmetric designsincidence matricesbipartite distance-regular graphs\((0,1)\) matrixzero-one matricesdegree of indecomposabilityHall matricesfully indecomposable matrices
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- The connectivity of strongly regular graphs
- Matching theory
- Primes in the semigroup of Boolean matrices
- Equiarboreal graphs
- Transversal theory. An account of some aspects of combinatorial mathematics
- On the connectivity of Cayley digraphs
- Optimally scalable matrices
- Partial λ-Geometries of Small Nexus
- Results on Measures of Irreducibility and Full Indecomposability
- Permanents
This page was built for publication: Degree of indecomposability of certain highly regular zero-one matrices