The determinant of the distance matrix of graphs with blocks at most bicyclic (Q2229502)
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 7312144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The determinant of the distance matrix of graphs with blocks at most bicyclic |
scientific article; zbMATH DE number 7312144 |
Statements
The determinant of the distance matrix of graphs with blocks at most bicyclic (English)
0 references
17 February 2021
0 references
The formula for computing the determinant of the distance matrix of a graph in terms of the number of vertices is known when the graph is either a tree or a unicyclic graph (see [\textit{R. Bapat} et al., Linear Algebra Appl. 401, 193--209 (2005; Zbl 1064.05097); \textit{R. L. Graham} and \textit{H. O. Pollak}, Bell Syst. Tech. J. 50, 2495--2519 (1971; Zbl 0228.94020)]). In this work, the authors generalize the known results, obtaining the determinant of the distance matrix of any graph whose block decomposition consists of edges, unicyclic and bicyclic graphs.
0 references
bicyclic graphs
0 references
determinant
0 references
distance matrix
0 references
0.8141429424285889
0 references
0.7877586483955383
0 references
0.78406822681427
0 references
0.7760291695594788
0 references
0.7703955769538879
0 references
