Automorphism groups of graph covers and uniform subset graphs. Issue 1 (1st April 2018)

• Record Type: Journal Article
• Authors: Mumba, N.B.; Mwambene, E.
• Is Part Of: AKCE International Journal of Graphs and Combinatorics. Volume 15:Issue 1(2018)
• Page Start: 27
• Page End: 30
• Publication Date: 2018-04-01
• Subjects: Graph covers -- Antipodal graphs -- Uniform subset graphs
• DOI: 10.1016/j.akcej.2018.01.016
• Languages: English
• ISSNs: 0972-8600

Abstract

Abstract: Hofmeister considered the automorphism groups of antipodal graphs through the exploration of graph covers. In this note we extend the exploration of automorphism groups of distance preserving graph covers. We apply the technique of graph covers to determine the automorphism groups of uniform subset graphs Γ ( 2 k, k, k − 1 ) and Γ ( 2 k, k, 1 ) . The determination of automorphism groups answers a conjecture posed by Mark Ramras and Elizabeth Donovan. They conjectured that Aut ( Γ ( 2 k, k, k − 1 ) ) ≅ S 2 k × < T >, where T is the complementation map X ↦ T ( X ) = X c = { 1, 2, …, 2 k } ∖ X, and X is a k -subset of Ω = { 1, 2, …, 2 k } .