The characteristic polynomial of a graph containing loops
From MaRDI portal
Abstract: 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.
Recommendations
- scientific article; zbMATH DE number 167520
- Chordal graphs and the characteristic polynomial
- Characteristic polynomials of some graph coverings
- Characterisation of regular graphs as loop graphs
- The characteristic polynomial of generalized lollipop graphs
- Graphs determined by their generalized characteristic polynomials
- scientific article; zbMATH DE number 2189819
- On characteristic polynomials of periodic graphs
- scientific article; zbMATH DE number 165464
- On conjugate characteristic polynomial of a graph
Cites work
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 3222645 (Why is no real title available?)
- scientific article; zbMATH DE number 3057366 (Why is no real title available?)
- Cayley sum color and anti-circulant graphs
- Energy and Laplacian energy of unitary addition Cayley graphs
- On the notion of balance of a signed graph
- Spektren endlicher Grafen
Cited in
(3)
This page was built for publication: The characteristic polynomial of a graph containing loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030251)