Abstract
The construction of the extended double cover was introduced by N. Alon [1] in 1986. For a simple graph G with vertex set V = {v 1, v 2, ..., v n }, the extended double cover of G, denoted G *, is the bipartite graph with bipartition (X, Y) where X = {x 1, x 2, ..., x n } and Y = {y 1, y 2, ..., y n }, in which x i and y j are adjacent iff i = j or v i and v j are adjacent in G.
In this paper we obtain formulas for the characteristic polynomial and the spectrum of G * in terms of the corresponding information of G. Three formulas are derived for the number of spanning trees in G * for a connected regular graph G. We show that while the extended double covers of cospectral graphs are cospectral, the converse does not hold. Some results on the spectra of the nth iterared double cover are also presented.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, Z. Spectra of Extended Double Cover Graphs. Czech Math J 54, 1077–1082 (2004). https://doi.org/10.1007/s10587-004-6452-2
Issue Date:
DOI: https://doi.org/10.1007/s10587-004-6452-2