Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights

DOI10.1080/03081087.2018.1505822zbMath1428.05182OpenAlexW2887214385WikidataQ114641428 ScholiaQ114641428MaRDI QIDQ5210721

Patrick Ali, Fouzul Atik, Ravindra B. Bapat

Publication date: 21 January 2020

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1505822

zbMATH Keywords

weighted graphMoore-Penrose inverseLaplacian matrixdistance matrixresistance matrix

Mathematics Subject Classification ID

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

Related Items (3)

Resistance distance of blowups of trees ⋮ Resistors in dual networks ⋮ Phase transition in spectral clustering based on resistance matrix

Cites Work

• On the resistance matrix of a graph
• Identities for minors of the Laplacian, resistance and distance matrices
• Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix
• Distance matrix polynomials of trees
• Laplacian matrices of graphs: A survey
• On distance matrices and Laplacians
• Outer inverses: Jacobi type identities and nullities of submatrices
• A simple proof of Graham and Pollak's theorem
• The distance matrix of a bidirected tree
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• On the Addressing Problem for Loop Switching
• Graphs and matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights