Abstract
We focus on the characteristic polynomial of a graph containing loops, but without multiple edges. We present a relationship between the characteristic polynomial of a graph with loops and the graph obtained by removing all the loops. In turn, we compute the characteristic polynomial of unitary addition Cayley graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
