# Show document

Title: Large sets of long distance equienergetic graphs Stevanović, Dragan (Author) http://amc.imfm.si/index.php/amc/article/viewFile/93/58 English Not categorized 1.01 - Original Scientific Article IAM - Andrej Marušič Institute 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 2009 str. 35-40 Vol. 2, no. 1 1855-3966 519.17 1024088916 1480 62 Document is not linked to any category.

Average score: (0 votes) Voting is allowed only to logged in users.

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

## Secondary language

Language: English teorija grafov, regular graphs

Leave comment