A simple proof of Graham and Pollak's theorem
From MaRDI portal
Publication:2497973
Recommendations
Cites work
Cited in
(19)- On the decomposition of random hypergraphs
- Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights
- New proofs of Bapat and Sivasubramanian's theorems
- The product distance matrix of a tree with matrix weights on its arcs
- The distance matrix of a tree with weights on its arcs
- Graph families with constant distance determinant
- Distance matrices of subsets of the Hamming cube
- A generalization of the Graham-Pollak tree theorem to even-order Steiner distance
- Decomposition of random graphs into complete bipartite graphs
- Inverses of \(q\)-distance matrices of a tree
- A new proof of a theorem of Graham and Pollak
- A generalization of the Graham-Pollak tree theorem to Steiner distance
- Distance matrices of a tree: two more invariants, and in a unified framework
- A \(q\)-analogue of distance matrix of block graphs
- Another simple proof of Graham and Pollak's theorem
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations
- The inverse of the distance matrix of a distance well-defined graph
- \(q\)-analogs of distance matrices of 3-hypertrees
- Proof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree
This page was built for publication: A simple proof of Graham and Pollak's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497973)