A generalization of the Graham-Pollak tree theorem to Steiner distance

DOI10.1016/j.disc.2023.113849arXiv2306.00243MaRDI QIDQ6197714

Unnamed Author, Joshua N. Cooper

Publication date: 19 February 2024

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

Full work available at URL: https://arxiv.org/abs/2306.00243

zbMATH Keywords

Steiner distancehyperdeterminanttree graphsnullvariety

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Cites Work

• Terminal Wiener index
• Distance matrix polynomials of trees
• Eigenvalues of a real supersymmetric tensor
• Discriminants, resultants, and multidimensional determinants
• Steiner distance in graphs
• On the Addressing Problem for Loop Switching
• Steiner's problem in graphs and its implications