Shi-Cai Gong, Ju-Li Zhang, Guang-Hui Xu
Published 2013-08-10Version 1
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.
The determinant of the distance matrix of graphs with at most two cycles
On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices
On distance matrices of wheel graphs with odd number of vertices
![QR code for arXiv:1308.2281 [math.CO]](http://oss.arxitics.com/images/favicon.svg)