The characteristic polynomial of agraph containing loops
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.