Affordable Access

Publisher Website

Automorphisms and regular embeddings of merged Johnson graphs

Authors
Journal
European Journal of Combinatorics
0195-6698
Publisher
Elsevier
Publication Date
Volume
26
Identifiers
DOI: 10.1016/j.ejc.2004.01.012

Abstract

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( K n )= J( n,2) 1 of complete graphs, their complements L(K n) =J(n,2) 2 , and the odd graphs O m+1 = J(2 m+1, m) m .

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Automorphisms of infinite Johnson graphs

on Discrete Mathematics Mar 06, 2013

Forest embeddings in regular graphs of large girth

on Journal of Combinatorial Theor... Jan 01, 1981

Regular embeddings of complete bipartite graphs

on Discrete Mathematics Jan 01, 2002
More articles like this..