Moore-Penrose inverse of incidence matrix of graphs with complete and cyclic blocks

DOI10.1016/j.disc.2018.09.020zbMath1400.05153OpenAlexW2896767995MaRDI QIDQ1618212

A. Azimi, Ehsan Estaji, Ravindra B. Bapat

Publication date: 13 November 2018

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

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

zbMATH Keywords

Moore-Penrose inverseblock graphcut vertex

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph designs and isomorphic decomposition (05C51)

Related Items (6)

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

• Generalized inverses. Theory and applications.
• Inverses of triangular matrices and bipartite graphs
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Moore-penrose inverse of the incidence matrix of a tree
• Unnamed Item
• Unnamed Item

This page was built for publication: Moore-Penrose inverse of incidence matrix of graphs with complete and cyclic blocks