In this paper we are mainly interested in the characterization of grid graphs i.e. products of paths.
Characterization of Laborde-Mulder graphs (extended odd graphs)
✍ Scribed by Rafaï-Mourad Madani
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 344 KB
- Volume
- 150
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this note, we settle a problem of N. Biggs [4, p. 801 by showing that for each k, no distance regular graph non-isomorphic to the odd graph Ok can have the same parameters as Ok. A related charxterization of certain graphs associated with the Johnson scheme J(2& + 1, k) is also g&en. By a graph w
## Abstract It is proved that a cyclically (__k__ − 1)(2__n__ − 1)‐edge‐connected edge transitive __k__‐regular graph with even order is __n__‐extendable, where __k__ ≥ 3 and __k__ − 1 ≥ __n__ ≥ ⌈(__k__ + 1)/2⌉. The bound of cyclic edge connectivity is sharp when __k__ = 3. © 1993 John Wiley & Sons