Distance powers of unitary Cayley graphs

Xiaogang Liu and Binlong Li

Applied Mathematics and Computation, 2016, vol. 289, issue C, 272-280

Abstract: Let G be a graph and let diam(G) denote the diameter of G. The distance power GN of G is the undirected graph with vertex set V(G), in which x and y are adjacent if their distance d(x, y) in G belongs to N, where N is a non-empty subset of {1,2,…,diam(G)}. The unitary Cayley graph is the graph having the vertex set Zn and the edge set {(a,b):a,b∈Zn,gcd(a−b,n)=1}. In this paper, we determine the energies of distance powers of unitary Cayley graphs, and classify all Ramanujan distance powers of unitary Cayley graphs. By the energies of distance powers of unitary Cayley graphs, we construct infinitely many pairs of non-cospectral equienergetic graphs. Moreover, we characterize all hyperenergetic distance powers of unitary Cayley graphs.

Keywords: Unitary Cayley graph; Distance power; Energy of a graph; Hyperenergetic graph; Equienergetic graphs; Ramanujan graph (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316303320
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:289:y:2016:i:c:p:272-280

DOI: 10.1016/j.amc.2016.05.023

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().