Edge-transitivity of Cayley graphs generated by transpositions

From MaRDI portal
Publication:339495

DOI10.7151/DMGT.1903zbMATH Open1350.05059arXiv1511.05430OpenAlexW2963607293MaRDI QIDQ339495FDOQ339495


Authors: Ashwin Ganesan Edit this on Wikidata


Publication date: 11 November 2016

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Abstract: Let S be a set of transpositions generating the symmetric group Sn. The transposition graph of S is defined to be the graph with vertex set 1,ldots,n, and with vertices i and j being adjacent in T(S) whenever (i,j)inS. 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.


Full work available at URL: https://arxiv.org/abs/1511.05430




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Edge-transitivity of Cayley graphs generated by transpositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339495)