On a theorem of Godsil and McKay concerning the construction of cospectral graphs

2020 ◽  
Vol 603 ◽  
pp. 265-274
Author(s):  
Lihong Qiu ◽  
Yizhe Ji ◽  
Wei Wang
Keyword(s):  
1982 ◽  
Vol 25 (1) ◽  
pp. 257-268 ◽  
Author(s):  
C. D. Godsil ◽  
B. D. McKay
Keyword(s):  

2018 ◽  
Vol 10 (06) ◽  
pp. 1850074 ◽  
Author(s):  
Somnath Paul

Let [Formula: see text] and [Formula: see text] be three graphs on disjoint sets of vertices and [Formula: see text] has [Formula: see text] edges. Let [Formula: see text] be the graph obtained from [Formula: see text] and [Formula: see text] in the following way: (1) Delete all the edges of [Formula: see text] and consider [Formula: see text] disjoint copies of [Formula: see text]. (2) Join each vertex of the [Formula: see text]th copy of [Formula: see text] to the end vertices of the [Formula: see text]th edge of [Formula: see text]. Let [Formula: see text] be the graph obtained from [Formula: see text] by joining each vertex of [Formula: see text] with each vertex of [Formula: see text] In this paper, we determine the adjacency (respectively, Laplacian, signless Laplacian) spectrum of [Formula: see text] in terms of those of [Formula: see text] and [Formula: see text] As an application, we construct infinite pairs of cospectral graphs.


2008 ◽  
Vol 21 (4) ◽  
pp. 338-341 ◽  
Author(s):  
Andréa S. Bonifácio ◽  
Cybele T.M. Vinagre ◽  
Nair Maria Maia de Abreu
Keyword(s):  

2019 ◽  
Vol 52 (2) ◽  
pp. 215-235 ◽  
Author(s):  
Supriyo Dutta ◽  
Bibhas Adhikari
Keyword(s):  

1994 ◽  
Vol 34 (5) ◽  
pp. 1103-1104
Author(s):  
K. Balasubramanian
Keyword(s):  

2004 ◽  
Vol 25 (2) ◽  
pp. 199-211 ◽  
Author(s):  
Willem H. Haemers ◽  
Edward Spence
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document