Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10118370 | European Journal of Combinatorics | 2005 | 19 Pages |
Abstract
The merged Johnson graph J(n,m)I is the union of the distance i graphs J(n,m)i of the Johnson graph J(n,m) for iâI, where â
â Iâ{1,â¦,m} and 2â¤mâ¤n/2. We find the automorphism groups of these graphs, and deduce that their only regular embedding in an orientable surface is the octahedral map on the sphere for J(4,2)1, and that they have just six non-orientable regular embeddings. This yields classifications of the regular embeddings of the line graphs L(Kn)=J(n,2)1 of complete graphs, their complements L(Kn)=J(n,2)2, and the odd graphs Om+1=J(2m+1,m)m.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gareth A. Jones,