INMABB 05456
INSTITUTO DE MATEMATICA BAHIA BLANCA
Unidad Ejecutora - UE
artículos
Título:
The determinant of the distance matrix of graphs with blocks at most bicyclic
Autor/es:
DRATMAN, EZEQUIEL; DA SILVA, CELSO M.; GRIPPO, LUCIANO N.; DEL-VECCHIO, RENATA R.; SAFE, MARTÍN D.
Revista:
LINEAR ALGEBRA AND ITS APPLICATIONS
Editorial:
ELSEVIER SCIENCE INC
Referencias:
Lugar: Amsterdam; Año: 2021 vol. 614 p. 437 - 454
ISSN:
0024-3795
Resumen:
Let G be a connected graph on n vertices and be its distance matrix. The formula for computing the determinant of this matrix in terms of the number of vertices is known when the graph is either a tree or a unicyclic graph. In this work we generalize these results, obtaining the determinant of the distance matrix of any graph whose block decomposition consists of edges, unicyclic and bicyclic graphs.
