The determinant of the distance matrix of graphs with blocks at most bicyclic (Q2229502): Difference between revisions

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.