Spectra and energies of iterated line graphs of regular graphs (Q2484670): Difference between revisions

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two graphs are said to be equienergetic if they have the same energy. There is a number of constructions of pairs of cospectral graphs in the literature, which are thus necessarily equienergetic. However, so far there are only a few known ways of constructing pairs of equienergetic, non-cospectral graphs. One such construction, which exploits simple properties of iterated line graphs, is presented in the paper under review. Important note to the reader: these results, in a slightly rewritten, but essentially the same form, already appear in a paper entitled ``Equienergetic graphs'' by the same set of authors, published in [Kragujevac J. Math. 26, 5--13 (2004; Zbl 1080.05061)].