Distance–regular graphs having theM-property
From MaRDI portal
Publication:2879650
DOI10.1080/03081087.2011.589047zbMath1237.05122OpenAlexW2017030473MaRDI QIDQ2879650
Enrique Bendito, Margarida Mitjana, Andrés M. Encinas, Ángeles Carmona
Publication date: 29 March 2012
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2011.589047
Theory of matrix inversion and generalized inverses (15A09) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (5)
Potential theory on finite networks ⋮ Boundary Value Problems on Finite Networks ⋮ The \(M\)-matrix group inverse problem for distance-biregular graphs ⋮ A note on distance-regular graphs with a small number of vertices compared to the valency ⋮ The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
Cites Work
- Shilla distance-regular graphs
- Strongly regular graphs with maximal energy
- Generalized inverses of symmetric \(M\)-matrices
- Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
- Partial and semipartial geometries: An update
- Group inverses of \(M\)-matrices associated with nonnegative matrices having few eigenvalues
- Solving boundary value problems on networks using equilibrium measures
- Algebraic Potential Theory on Graphs
- Distance-Regular Graphs with Diameter Three
- Group generalized inverses of M-matrices associated with periodic and nonperiodic jacobi matrices
- Maximal energy graphs
This page was built for publication: Distance–regular graphs having theM-property