The characteristic polynomial of agraph containing loops

Discrete Appl. Math., 300 (2021), 97-106 In this article, we focus on the characteristic polynomial of a graph containingloops, but without multiple edges. We present a relationship between thecharacteristic polynomial of a graph with loops and the graph obtained byremoving all the loops. In turn, w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Sinha, Deepa, Kaur, Bableen, Zaslavsky, Thomas
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Discrete Appl. Math., 300 (2021), 97-106 In this article, we focus on the characteristic polynomial of a graph containingloops, but without multiple edges. We present a relationship between thecharacteristic polynomial of a graph with loops and the graph obtained byremoving all the loops. In turn, we compute the characteristic polynomial ofunitary addition Cayley graphs.
DOI:10.48550/arxiv.2005.06903