Characterizing distance-regularity of graphs by the spectrum
SCIE
SCOPUS
- Title
- Characterizing distance-regularity of graphs by the spectrum
- Authors
- van Dam, ER; Haemers, WH; Koolen, JH; Spence, E
- Date Issued
- 2006-11
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Abstract
- We characterize the distance-regular Ivanov-Ivanov-Faradjev graph from the spectrum, and construct cospectral graphs of the Johnson graphs, Doubled Odd graphs, Grassmann graphs, Doubled Grassmann graphs, antipodal covers of complete bipartite graphs, and many of the Taylor graphs. We survey the known results on cospectral graphs of the Hamming graphs, and of all distance-regular graphs on at most 70 vertices. (c) 2006 Elsevier Inc. All rights reserved.
- Keywords
- distance-regular graphs; eigenvalues; cospectral graphs; 3-CLASS ASSOCIATION SCHEMES; UNIQUENESS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/29546
- DOI
- 10.1016/J.JCTA.2006.
- ISSN
- 0097-3165
- Article Type
- Article
- Citation
- JOURNAL OF COMBINATORIAL THEORY SERIES A, vol. 113, no. 8, page. 1805 - 1820, 2006-11
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.