Edge-Transitivity of Cayley Graphs Generated by Transpositions

• Autorzy: Ashwin Ganesan
• Języki publikacji: EN

Abstrakty

EN

Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . . , n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note, it is proved that two transposition graphs are isomorphic if and only if the corresponding two Cayley graphs are isomorphic. It is also proved that the transposition graph T(S) is edge-transitive if and only if the Cayley graph Cay(Sn, S) is edge-transitive.

Słowa kluczowe

EN

Cayley graphs; transpositions; automorphisms of graphs; edge-transitive graphs; line graphs; Whitney’s isomorphism theorem

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2016
• Tom: 36
• Numer: 4
• Strony: 1035-1042

Daty

wydano

2016-11-01

otrzymano

2015-11-27

zaakceptowano

2016-01-22

online

2016-10-21

Twórcy

autor

Ashwin Ganesan

• 53 Deonar House, Deonar Village Road, Deonar Mumbai 400088, Maharashtra,

Identyfikatory

DOI

10.7151/dmgt.1903