Graph families with constant distance determinant (Q1630898)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6989246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph families with constant distance determinant |
scientific article; zbMATH DE number 6989246 |
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
0.7737556099891663
0 references
0.7336466312408447
0 references
0.7311784625053406
0 references
0.7287283539772034
0 references
0.7242698669433594
0 references
