2018
DOI: 10.48550/arxiv.1804.00369
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On graphs with smallest eigenvalue at least -3 and their lattices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…For the case of graphs with smallest eigenvalue at least −3, Koolen, Yang and Yang [24] generalized a result of Hoffman (1977) [21] and showed the following.…”
Section: Introductionmentioning
confidence: 91%
See 1 more Smart Citation
“…For the case of graphs with smallest eigenvalue at least −3, Koolen, Yang and Yang [24] generalized a result of Hoffman (1977) [21] and showed the following.…”
Section: Introductionmentioning
confidence: 91%
“…, 22} as their point sets, respectively. By following [13], we find that the Leech lattice Λ 24 is generated by the following 760 (= 1 + 759) vectors: 16 ), in which the positions of the eight 2's form a block of S (5,8,24).…”
Section: The Complement Of the Mclaughlin Graphmentioning
confidence: 99%