The following pages link to On cliques in edge-regular graphs (Q468702):
Displaying 9 items.
- Designs over regular graphs with least eigenvalue \(-2\) (Q825523) (← links)
- Edge-regular graphs with regular cliques (Q1750219) (← links)
- On the clique number of a strongly regular graph (Q1991424) (← links)
- Upper bounds on the size of transitive subtournaments in digraphs (Q2013188) (← links)
- An infinite class of Neumaier graphs and non-existence results (Q2084987) (← links)
- Bounds for regular induced subgraphs of strongly regular graphs (Q2092379) (← links)
- The smallest strictly Neumaier graph and its generalisations (Q2420557) (← links)
- A general construction of strictly Neumaier graphs and a related switching (Q6046159) (← links)
- On the Existence of Small Strictly Neumaier Graphs (Q6489361) (← links)
