Fetching the paper…
Reading the bibliography…
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix.
C. Godsil and B. D. McKay. Constructing cospectral graphs. Aeq. Math. 25 (1982) 257-268
1982
Earlier work this paper cites.
R. Merris. Laplacian matrices of graphs: a survey. Linear Algebra and its Applications. 197 (1994). 143–176
1994
Earlier work this paper cites.
2002
Earlier work this paper cites.
E. R. van Dam and W. H. Haemers. Which graphs are determined by their spectrum? Linear Algebra Appl. 373 (2003). 139–162
2003
Earlier work this paper cites.
K. Ch. Das. The Laplacian spectrum of a graph. Computers and Mathematics with App. 48 (2004). 715–724
2004
Cited alongside, same era.
W.H. Haemers and E. Spence. Enumeration of cospectral graphs. European Journal of Combinatorics. 25 (2004). 199–211
2004
Cited alongside, same era.
S. Butler and J. Grout. A construction of cospectral graphs for the normalized Laplacian. Elec J. of Combinatorics. 18 (2011) P231, 20pp
2011
Cited alongside, same era.
A. Abiad and W. H. Haemers. Cospectral graphs and regular orthogonal matrices of level 2. Elec J. of Combinatorics. 19(3) (2012) P13, 16pp
2012
Cited alongside, same era.
M. Aouchiche and P. Hansen, Two Laplacians for the distance matrix of a graph. Linear Algebra Appl. 439 (2013). 21–33
2013
Later among the works it cites.
K. Heysse. A construction of distance cospectral graphs. Linear Algebra and its Applications. 535 (2017). 195–212
2017
Later among the works it cites.
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…