Graph families with constant distance determinant (Q1630898): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph families with constant distance determinant |
scientific article |
Statements
Graph families with constant distance determinant (English)
0 references
5 December 2018
0 references
Summary: This paper introduces a new class of graphs, the clique paths (or 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 to 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 \textit{R. L. Graham} and \textit{H. O. Pollak} [Bell Syst. Tech. J. 50, 2495--2519 (1971; Zbl 0228.94020)] are given.
0 references
CP graph
0 references
linear 2-tree
0 references
distance matrix
0 references
determinant
0 references
inertia
0 references
