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.









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)