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)
✦ LIBER ✦
On regular graphs. IV
✍ Scribed by D.Ž Djoković
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 280 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Distance-regular Subgraphs in a Distance
✍
Akira Hiraki
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 280 KB
On End-regular graphs
✍
Suohai Fan
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 390 KB
A graph X is End-regular if its endomorphism monoid End X is regular in the sernigroup sense, that is, for any fin End X there exists g in End X with fgf=f. End-regular bipartite graphs were characterized in [l]. In this paper, End-regular graphs are obtained through the lexicographic product of End
On regular graphs. II
✍
D.Z̆ Djoković
📂
Article
📅
1972
🏛
Elsevier Science
🌐
English
⚖ 411 KB
On regular graphs. III
✍
I.Z Bouwer; D.Ž Djoković
📂
Article
📅
1973
🏛
Elsevier Science
🌐
English
⚖ 580 KB
On regular graphs, V
✍
Dragomir Ž Djoković
📂
Article
📅
1979
🏛
Elsevier Science
🌐
English
⚖ 550 KB
On regular graphs, VI
✍
Dragomir Ž Djoković
📂
Article
📅
1979
🏛
Elsevier Science
🌐
English
⚖ 391 KB