Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 (Q2462330): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2006.10.001 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2014797604 / rank | |||
Normal rank |
Revision as of 01:23, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 |
scientific article |
Statements
Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 (English)
0 references
30 November 2007
0 references
The graphs of the type mentioned in the title are studied. First, the authors show that the eigenvalue \(\theta\) with the multiplicity equal to the valency satisfies \(\theta=-1\) if and only if the graph is antipodal. Then, the authors consider the primitive (i.e. non-antipodal) case. The only known example of such a graph is the coset graph of the doubly truncated binary Golay code. A number of properties of such graphs, such as formal self-duality, is established, and possible intersection arrays for the valency up to 4000 are studied. Under a natural extra condition on sizes of certain subgraphs the uniqueness of the only known example is shown.
0 references
distance-regular graph
0 references
formal self-duality of association schemes
0 references
graph eigenvalues
0 references