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. (C) 2021 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
---|---|---|
2021 | 10.1016/j.dam.2021.04.025 | DISCRETE APPLIED MATHEMATICS |
Keywords | DocType | Volume |
Graph with loops, Characteristic polynomial | Journal | 300 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Deepa Sinha | 1 | 1 | 5.44 |
Bableen Kaur | 2 | 0 | 0.68 |
T. Zaslavsky | 3 | 297 | 56.67 |