Identities for minors of the Laplacian, resistance and distance matrices

DOI10.1016/J.LAA.2011.03.028zbMATH Open1221.05227OpenAlexW2086540021MaRDI QIDQ551303FDOQ551303

Sivaramakrishnan Sivasubramanian, R. B. Bapat

Publication date: 15 July 2011

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

Full work available at URL: https://doi.org/10.1016/j.laa.2011.03.028

zbMATH Keywords

determinantdistance matrixLaplacianresistance matrix\(q\)-analoguepartitioned matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Matrix equations and identities (15A24)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrix Analysis
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• On the Addressing Problem for Loop Switching
• Distance matrix polynomials of trees
• Zeta functions of finite graphs and coverings
• A \(q\)-analogue of the distance matrix of a tree
• Generalized matrix tree theorem for mixed graphs
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• On the distance matrix of a directed graph
• A note on the zeta function of a graph
• Zeta functions of line, middle, total graphs of a graph and their coverings
• \(q\)-analogs of distance matrices of 3-hypertrees

Cited In (15)

• Color signless Laplacian energy of graphs
• Resistance matrices of balanced directed graphs
• On the resistance matrix of a graph
• Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights
• A recursion formula for resistance distances and its applications
• On a quadratic programming problem involving distances in trees
• Algorithmic techniques for finding resistance distances on structured graphs
• On solving a non-convex quadratic programming problem involving resistance distances in graphs
• Some results on the Laplacian spectra of graphs with pockets
• Hitting time quasi-metric and its forest representation
• The 2-Steiner distance matrix of a tree
• Simple expressions for the long walk distance
• The walk distances in graphs
• A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
• The Arithmetic Tutte polynomial of two matrices associated to Trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551303)