Distance-regular graphs having the M-property
DOI10.1080/03081087.2011.589047zbMATH Open1237.05122OpenAlexW2017030473MaRDI QIDQ2879650FDOQ2879650
Authors: Enrique Bendito, A. Carmona, A. M. Encinas, M. Mitjana
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
Recommendations
- On the Moore-Penrose inverse of distance-regular graphs
- Moore-Penrose inverse of the incidence matrix of a distance regular graph
- The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
- On the distance spectrum of distance regular graphs
- Distance-regular subgraphs in a distance-regular graph. I
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Theory of matrix inversion and generalized inverses (15A09) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)
Cites Work
- Maximal energy graphs
- Algebraic Potential Theory on Graphs
- Shilla distance-regular graphs
- Group inverses of \(M\)-matrices associated with nonnegative matrices having few eigenvalues
- Strongly regular graphs with maximal energy
- Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
- Solving boundary value problems on networks using equilibrium measures
- Group generalized inverses of M-matrices associated with periodic and nonperiodic jacobi matrices
- Generalized inverses of symmetric \(M\)-matrices
- Partial and semipartial geometries: An update
- Distance-Regular Graphs with Diameter Three
Cited In (8)
- Edge-distance-regular graphs are distance-regular
- Potential theory on finite networks
- Boundary value problems on finite networks
- Title not available (Why is that?)
- The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
- A note on distance-regular graphs with a small number of vertices compared to the valency
- On distance Laplacian matrices of weighted trees
- The \(M\)-matrix group inverse problem for distance-biregular graphs
This page was built for publication: Distance-regular graphs having the \(M\)-property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879650)