“…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
Koolen et al. showed that if a connected graph with smallest eigenvalue at least −3 has large minimal valency, then it is 2-integrable. In this paper, we will prove that a lower bound for the minimal valency is 166.
“…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
Koolen et al. showed that if a connected graph with smallest eigenvalue at least −3 has large minimal valency, then it is 2-integrable. In this paper, we will prove that a lower bound for the minimal valency is 166.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.