A Classification of Graphs Whose Subdivision Graph is Locally Distance Transitive
β Scribed by Ashraf Daneshkhah, Alice Devillers
- Book ID
- 118783106
- Publisher
- Springer Japan
- Year
- 2011
- Tongue
- English
- Weight
- 175 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we consider a bipartite distance-regular graph = (X, E) with diameter d β₯ 3. We investigate the local structure of , focusing on those vertices with distance at most 2 from a given vertex x. To do this, we consider a subalgebra R = R(x) of Mat X (C), where X denotes the set of vertice
Koh, Rogers and Tan (Discrete Math. 25 (1979) [141][142][143][144][145][146][147][148] give a method to construct a bigger graceful tree from two graceful trees. Based upon their results, we give a new construction, which allows us to prove that the subdivision graph of a graceful tree is still a gr