Identities for minors of the Laplacian, resistance and distance matrices
From MaRDI portal
(Redirected from Publication:551303)
Recommendations
- Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights
- Determinant identities for Laplace matrices
- Distance matrix and Laplacian of a tree with attached graphs
- On minors of the compound matrix of a Laplacian
- scientific article; zbMATH DE number 1538963
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 5784227 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 2121250 (Why is no real title available?)
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A \(q\)-analogue of the distance matrix of a tree
- A note on the zeta function of a graph
- Distance matrix polynomials of trees
- Generalized matrix tree theorem for mixed graphs
- Matrix Analysis
- On the Addressing Problem for Loop Switching
- On the distance matrix of a directed graph
- Resistance matrix and \(q\)-Laplacian of a unicyclic graph
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- Zeta functions of finite graphs and coverings
- Zeta functions of line, middle, total graphs of a graph and their coverings
- \(q\)-analogs of distance matrices of 3-hypertrees
Cited in
(19)- Color signless Laplacian energy of graphs
- On minors of the compound matrix of a Laplacian
- 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
- Distance matrix and Laplacian of a tree with attached graphs
- A formula for all minors of the adjacency matrix and an application
- 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
- scientific article; zbMATH DE number 1538963 (Why is no real title available?)
- 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)