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

DOI10.1515/SPMA-2024-0018MaRDI QIDQ6590697zbMATH OpenFDO

Authors Joshua Cooper

Publication date 21 August 2024

Published in Special Matrices (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/SPMA-2024-0018

zbMATH Keywords

hyperdeterminantSteiner distancetree graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Multilinear algebra, tensor calculus (15A69)

Recommendations

• A generalization of the Graham-Pollak tree theorem to Steiner distance
• Note on the spectra of Steiner distance hypermatrices
• Another simple proof of Graham and Pollak's theorem
• A simple proof of Graham and Pollak's theorem

Cites work

• A generalization of the Graham-Pollak tree theorem to Steiner distance
• On the Addressing Problem for Loop Switching

Cited in

(4)

• A generalization of the Graham-Pollak tree theorem to Steiner distance
• Note on the spectra of Steiner distance hypermatrices
• The spectral radius of Steiner distance hypermatrices of graphs
• On the hyperdeterminants of Steiner distance hypermatrices

This page was built for publication: A generalization of the Graham-Pollak tree theorem to even-order Steiner distance

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