Artículo

The determinant of the distance matrix of graphs with blocks at most bicyclic

Dratman, EzequielIcon ; Grippo, Luciano NorbertoIcon ; Safe, Martin DarioIcon ; da Silva, Celso M.; Del Vecchio, Renata R.
Fecha de publicación: 01/04/2021
Editorial: Elsevier Science Inc.
Revista: Linear Algebra and its Applications
ISSN: 0024-3795
e-ISSN: 1873-1856
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:

Resumen

Let G be a connected graph on n vertices and D(G) 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.
Palabras clave: BICYCLIC GRAPHS , DETERMINANT , DISTANCE MATRIX
 
Archivos asociados
Thumbnail
 
Tamaño: 179.2Kb
Formato: PDF
.
Licencia
info:eu-repo/semantics/openAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/153686
URL: https://www.sciencedirect.com/science/article/pii/S0024379520305334
DOI: https://doi.org/10.1016/j.laa.2020.11.008
URL: https://arxiv.org/abs/1912.09604
Colecciones
Articulos(SEDE CENTRAL)
Articulos de SEDE CENTRAL
Citación
Dratman, Ezequiel; Grippo, Luciano Norberto; Safe, Martin Dario; da Silva, Celso M.; Del Vecchio, Renata R.; The determinant of the distance matrix of graphs with blocks at most bicyclic; Elsevier Science Inc.; Linear Algebra and its Applications; 614; 1-4-2021; 437-454
Compartir
Altmétricas