The determinant of the distance matrix of graphs with at most two cycles

Let $G$ be a connected graph on $n$ vertices and $D(G)$ 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 determinan...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Dratman, Ezequiel, Grippo, Luciano N, Safe, Matín D, SilvaJr, Celso M. da, Del-Vecchio, Renata R
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!