Strongly Closed Subgraphs in a Distance-Regular Graph withc2
β Scribed by Akira Hiraki
- Book ID
- 106047757
- Publisher
- Springer Japan
- Year
- 2008
- Tongue
- English
- Weight
- 195 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Let be a distance-regular graph with where r β₯ 2 and c r +1 > 1. We prove that r = 2 except for the case a 1 = a r +1 = 0 and c r +1 = 2 by showing the existence of strongly closed subgraphs.
Let β« be a distance-regular graph with l (1 , a 1 , b 1 ) Ο 1 and c s Ο© 1 Ο 1 for some positive integer s . We show the existence of a certain distance-regular graph of diameter s , containing given two vertices at distance s , as a subgraph in β« .
Let β« be a distance-regular graph with a 1 ΟΎ 0 , r Ο max Ν j 3 ( c j , a j , b j ) Ο ( c 1 , a 1 , b 1 ) Ν Ρ 2 and a i Ο a 1 c i , for 1 Ρ i Ρ 2 r . Take any u and in β« at distance r Ο© 1 . We show that there exists a collinearity graph of a generalized 2( r Ο© 1)-gon of order ( a 1 Ο© 1 , c r Ο© 1 Οͺ 1)