Large sets of long distance equienergetic graphs
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.
2009
2013-10-15 12:06:19
1033
graph theory, distance spectrum, distance energy, join, regular graphs
teorija grafov, regular graphs
Dragan
Stevanović
70
UDK
4
519.17
ISSN pri članku
9
1855-3966
COBISS.SI-ID
3
1024088916
0
Predstavitvena datoteka
2013-10-15 12:06:19
RAZ_Stevanovic_Dragan_i2009.pdf
148097
Predstavitvena datoteka
2021-12-30 21:45:07