20.500.12556/RUP-1727 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. graph theory distance spectrum distance energy join regular graphs teorija grafov regular graphs true true false Angleški jezik Angleški jezik Neznano 2013-10-15 12:06:19 2013-10-15 12:06:19 2024-03-01 12:01:48 0000-00-00 00:00:00 2009 0 0 str. 35-40 no. 1 Vol. 2 2009 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 1855-3966 1024088916 RAZ_Stevanovic_Dragan_i2009.pdf RAZ_Stevanovic_Dragan_i2009.pdf 1 41E96F3F3D8EA8797CA6EDBFEAA63CC3 4601e08eba3d4cde374d1311c2c2fcf965fc4dab7faf451f23ae643abf7956e9 769b6616-c3d6-11ed-b5df-005056bf369b https://repozitorij.upr.si/Dokument.php?lang=slv&id=25902 Založba Univerze na Primorskem 0 0 0