In this paper we give a sufficient condition for the existence of a strongly closed subgraph which is (c q + a q )-regular of diameter q containing a given pair of vertices at distance q in a distance-regular graph. Moreover we show that a distance-regular graph with r = max{ j | (c j , a j , b j )
✦ LIBER ✦
On regular graphs, VI
✍ Scribed by Dragomir Ž Djoković
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 391 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Distance-regular Subgraphs in a Distance
✍
A. Hiraki
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 202 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. IV
✍
D.Ž Djoković
📂
Article
📅
1973
🏛
Elsevier Science
🌐
English
⚖ 280 KB
On regular graphs, V
✍
Dragomir Ž Djoković
📂
Article
📅
1979
🏛
Elsevier Science
🌐
English
⚖ 550 KB