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
✦ LIBER ✦
On strongly regular graphs with μ ≥ 2
✍ Scribed by Bhaskar Bagchi
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 59 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Strongly Regular Square-free Graphs with
✍
Benjamin V.C. Collins
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 277 KB
On Strongly Regular Graphs withμ =&
✍
J. Deutsch; P.H. Fisher
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 75 KB
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
Strongly regular Cayley graphs with λ −
✍
K.T Arasu; D Jungnickel; S.L Ma; A Pott
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 451 KB
On regular Terwilliger graphs with μ=2
✍
A. A. Makhnëv
📂
Article
📅
1996
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 190 KB
Strongly regular graphs with maximal ene
✍
Willem H. Haemers
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 90 KB
Strongly regular graphs with λ=1
✍
A. A. Makhnev
📂
Article
📅
1988
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 295 KB