Strongly regular Cayley graphs with λ − μ = −1
✍ Scribed by K.T Arasu; D Jungnickel; S.L Ma; A Pott
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 451 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We consider strongly regular graphs in which each non-adjacent pair of vertices has exactly one common neighbour. These graphs give rise to partial linear spaces (one of which is a partial quadrangle) and a distance-regular graph of diameter three. The lower bound for the valency of the graph in ter
By a square in an undirected graph ⌫ , we mean a cycle x , y , z , w such that x is not adjacent to z and y is not adjacent to w . Suppose that ⌫ is a strongly regular graph with ϭ 2 , and assume that ⌫ does not contain a square . Pick any vertex x of ⌫ and let ⌫ Ј denote the induced subgraph on the