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.
@article{bwmeta1.element.doi-10_7151_dmgt_1903,
author = {Ashwin Ganesan},
title = {Edge-Transitivity of Cayley Graphs Generated by Transpositions},
journal = {Discussiones Mathematicae Graph Theory},
volume = {36},
year = {2016},
pages = {1035-1042},
zbl = {1350.05059},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1903}
}
Ashwin Ganesan. Edge-Transitivity of Cayley Graphs Generated by Transpositions. Discussiones Mathematicae Graph Theory, Tome 36 (2016) pp. 1035-1042. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1903/