Distance spectra and distance energy of integral circulant graphs

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: The distance energy of a graph

G

is a recently developed energy-type invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix of

G

. There was a vast research for the pairs and families of non-cospectral graphs having equal distance energy, and most of these constructions were based on the join of graphs. A graph is called circulant if it is Cayley graph on the circulant group, i.e. its adjacency matrix is circulant. A graph is called integral if all eigenvalues of its adjacency matrix are integers. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer. In this paper, we characterize the distance spectra of integral circulant graphs and prove that these graphs have integral eigenvalues of distance matrix

D

. Furthermore, we calculate the distance spectra and distance energy of unitary Cayley graphs. In conclusion, we present two families of pairs

(G_{1}, G_{2})

of integral circulant graphs with equal distance energy -- in the first family

G_{1}

is subgraph of

G_{2}

, while in the second family the diameter of both graphs is three.

Recommendations

Cites work

Cited in

(37)

This page was built for publication: Distance spectra and distance energy of integral circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984867)