论文信息 - Graphs Cospectral with Kneser Graphs

Graphs Cospectral with Kneser Graphs

We construct graphs that are cospectral but nonisomorphic with Kneser graphs K(n, k), when n =3k - 1, k> 2 and for inﬁnitely many other pairs (n, k). We also prove that for 3 ≤ k ≤ n - 3 the Modulo-2 Kneser graph K2(n, k) is not determined by the spectrum.

Willem H. Haemers | Farzaneh Ramezani | W. Haemers | F. Ramezani

[1] B. McKay,et al. Constructing cospectral graphs , 1982 .

[2] Brendan D. McKay,et al. Classification of regular two-graphs on 36 and 38 vertices , 2001, Australas. J Comb..

[3] Spectral Characterization of Some Generalized Odd Graphs , 1999, Graphs Comb..

[4] W. Haemers,et al. Which graphs are determined by their spectrum , 2003 .

[5] Anne Penfold Street,et al. Overlarge sets and partial geometries , 1997 .

[6] Willem H. Haemers,et al. Characterizing distance-regularity of graphs by the spectrum , 2006, J. Comb. Theory, Ser. A.

[7] Willem H. Haemers,et al. Developments on Spectral Characterizations of Graphs , 2007, Discret. Math..

[8] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[9] Richard M. Wilson,et al. A course in combinatorics , 1992 .