Abstract

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.

Keywords

teorija grafov;regular graphs;graph theory;distance spectrum;distance energy;join;

Data

Language: English
Year of publishing:
Typology: 1.01 - Original Scientific Article
Organization: UP - University of Primorska
UDC: 519.17
COBISS: 1024088916 Link will open in a new window
ISSN: 1855-3966
Parent publication: Ars mathematica contemporanea
Views: 3391
Downloads: 136
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary keywords: teorija grafov;regular graphs;
Type (COBISS): Not categorized
Pages: str. 35-40
Volume: ǂVol. ǂ2
Issue: ǂno. ǂ1
Chronology: 2009
Keywords (UDC): mathematics;natural sciences;naravoslovne vede;matematika;mathematics;matematika;combinatorial analysis;graph theory;kombinatorika;
ID: 14092543
Recommended works:
, no subtitle data available
, no subtitle data available
, no subtitle data available
, no subtitle data available