Loading...
Spectral Characterizations of Some Distance-Regular Graphs
van Dam,E.R. Haemers,W.H.
van Dam,E.R.
Haemers,W.H.
Abstract
When can one see from the spectrum of a graph whether it is distance-regular or not?We give some new results for when this is the case.As a consequence we find (among others) that the following distance-regular graphs are uniquely determined by their spectrum: The collinearity graphs of the generalized octagons of order (2; 1), (3; 1) and (4; 1), the Biggs-Smith graph, the M22 graph, and the coset graphs of the doubly truncated binary Golay code and the extended ternary Golay code.
Description
Pagination: 12
Date
2000
Journal Title
Journal ISSN
Volume Title
Publisher
Operations research
Files
Loading...
793.pdf
Adobe PDF, 204.69 KB
Research Projects
Organizational Units
Journal Issue
Keywords
graph theory, graphs
Citation
van Dam, E R & Haemers, W H 2000, Spectral Characterizations of Some Distance-Regular Graphs. FEW Research Memorandum, vol. 793, vol. 793, Operations research, Tilburg.