The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs

DOI10.1016/j.disc.2019.05.007zbMath1418.05081OpenAlexW2946779438WikidataQ127823029 ScholiaQ127823029MaRDI QIDQ2319724

Ravindra B. Bapat, A. Azimi

Publication date: 20 August 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.05.007

zbMATH Keywords

Moore-Penrose inversecomplete \(r\)-partite graphbi-block graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (2)

The \(M\)-matrix group inverse problem for distance-biregular graphs ⋮ Unnamed Item

Cites Work

• Resistance distance in complete \(n\)-partite graphs
• Moore-Penrose inverse of incidence matrix of graphs with complete and cyclic blocks
• A generalized inverse for graphs with absorption
• Generalized inverses. Theory and applications.
• The Moore-Penrose inverse of matrices with an acyclic bipartite graph
• Moore-Penrose inverse of the incidence matrix of a distance regular graph
• The Moore-Penrose inverse of the normalized graph Laplacian
• Inverses of triangular matrices and bipartite graphs
• Moore-penrose inverse of the incidence matrix of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs