On the determinant of the distance matrix of a bicyclic graph
classification
🧮 math.CO
keywords
determinantdistancegraphmatrixbicycliccyclesdisjointformula
read the original abstract
Two cycles are referred as disjoint if they have no common edges. In this paper, we will investigate the determinant of the distance matrix of a graph, giving a formula for the determinant of the distance matrix of a bicyclic graph whose two cycles are disjoint, which extends the formula for the determinant of the distance matrix of a tree, as well as that of a unicyclic graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.