2021
DOI: 10.1016/j.ejc.2021.103384
|View full text |Cite
|
Sign up to set email alerts
|

Augmenting the Delsarte bound: A forbidden interval for the order of maximal cliques in strongly regular graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…Using Lemma 1, Greaves et al [6] derived a method restricting the order of maximal cliques in a strongly regular graph. They showed the following result.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Using Lemma 1, Greaves et al [6] derived a method restricting the order of maximal cliques in a strongly regular graph. They showed the following result.…”
Section: Introductionmentioning
confidence: 99%
“…Lemma 2 (cf. [6,Lemma 3.7]). Let G be a strongly regular graph with parameters (n, k, λ, µ) having smallest eigenvalue −m.…”
Section: Introductionmentioning
confidence: 99%