Distance Critical Graphs (2405.09656v1)
Abstract: In 1971, Graham and Pollak provided a formula for the determinant of the distance matrix of any tree on $n$ vertices. Yan and Yeh reproved this by exploiting the fact that pendant vertices can be deleted from trees without changing the remaining entries of the distance matrix. Considering failures of their argument to generalize invites the question: which graphs have the property that deleting any one vertex results in a change to some pairwise distance? We refer to such worst-case graphs as ``distance critical''. This work explores the structural properties of distance critical graphs, preservation of distance-criticality by products, and the nature of extremal distance critical graphs. We end with a few open questions.
- Distance spectra of graphs: A survey. Linear Algebra and its Applications, 458:301–386, 2014.
- On the addressing problem for loop switching. Bell System Tech. J., 50:2495–2519, 1971.
- OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences, 2024. Published electronically at http://oeis.org.
- The Sage Developers. SageMath, the Sage Mathematics Software System (Version x.y.z), YYYY. https://www.sagemath.org.
- A simple proof of Graham and Pollack’s theorem. Journal of Combinatorial Theory, 113:892 – 893, 2006.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.