Distance energy of a graph is a recent energy-type invariant, defined as the absolute deviation of the eigenvalues of the distance matrix of the graph. Two graphs of the same order are said to be distance equienergetic if they have equal distance energy, while they have distinct spectra of their distance matrices. Examples of pairs of distance equienergetic graphs appear in the literature already, but most of them have diameter two only. We describe here the distance spectrum of a special composition of regular graphs, and, as an application, we show that for any ?$n \ge 3$?, there exists a set of ?$n + 1$? distance equienergetic graphs which have order ?$6n$? and diameter ?$n - 1$? each.

Rights

URN

URN:NBN:SI:DOC-VDXQ172M

COBISSID

1024088916

Added

16.12.2021

Metadata

Citation

APA:

Stevanović, Dragan (2009). Large sets of long distance equienergetic graphs. Ars mathematica contemporanea, volume 2, issue 1, str. 35-40. URN:NBN:SI:DOC-VDXQ172M from http://www.dlib.si

MLA:

Stevanović, Dragan. "Large sets of long distance equienergetic graphs." Ars mathematica contemporanea volume 2. issue 1 (2009) str. 35-40.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-VDXQ172M>

Ars mathematica contemporanea
2008-
(Assembly record)