Moore-Penrose inverse of the incidence matrix of a distance regular graph
From MaRDI portal
Publication:2002810
DOI10.1016/j.laa.2018.04.003zbMath1418.05067OpenAlexW2796062592MaRDI QIDQ2002810
Publication date: 12 July 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.04.003
Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items
The \(M\)-matrix group inverse problem for distance-biregular graphs ⋮ Moore-Penrose inverse of the signless Laplacians of bipartite graphs ⋮ The inverse of the incidence matrix of a unicyclic graph ⋮ Resistance distance of blowups of trees ⋮ Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs ⋮ The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resistance distance in complete \(n\)-partite graphs
- Resistance distances and Kirchhoff index of graphs with an involution
- Resistance distance in wheels and fans
- A generalized inverse for graphs with absorption
- The Moore-Penrose inverse of matrices with an acyclic bipartite graph
- Resistance distances in Cayley graphs on symmetric groups
- The Moore-Penrose inverse of the normalized graph Laplacian
- Inverses of triangular matrices and bipartite graphs
- Resistance distances and the Kirchhoff index in double graphs
- Moore-penrose inverse of the incidence matrix of a tree
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs
- Minimizing Effective Resistance of a Graph
- Metric and ultrametric spaces of resistances