On the distance matrices of the CP graphs

arXiv1805.10269MaRDI QIDQ6302124FDOQ6302124

Authors: Yen-Jen Cheng, Jephian Chin-Hung Lin 

Publication date: 25 May 2018

Abstract: This paper introduces a new class of graphs, the CP graphs, and shows that their distance determinant and distance inertia are independent of their structures. The CP graphs include the family of linear $2$-trees. When a graph is attached with a CP graph, it is shown that the distance determinant and the distance inertia are also independent of the structure of the CP graph. Applications to the addressing problem proposed by Graham and Pollak in 1971 are given.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15) Distance in graphs (05C12)

This page was built for publication: On the distance matrices of the CP graphs

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