Abstract
Graham and Pollak showed that the determinant of the distance matrix of a tree T depends only on the number of vertices of T. Graphical distance, a function of pairs of vertices, can be generalized to “Steiner distance” of sets S of vertices of arbitrary cardinality, by defining it to be the minimum number of edges in a connected subgraph containing all the vertices of S. Here, we show that the same is true for trees' Steiner distance hypermatrix of all odd orders, whereas the theorem of Graham-Pollak concerns order 2. We conjecture that the statement holds for all even orders as well.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
