Automorphism group of the complete transposition graph

被引:0
|
作者
Ashwin Ganesan
机构
[1] Vidyalankar Institute of Technology,Department of Electronics and Telecommunication Engineering
来源
关键词
Complete transposition graph; Automorphisms of graphs; Normal Cayley graphs;
D O I
暂无
中图分类号
学科分类号
摘要
The complete transposition graph is defined to be the graph whose vertices are the elements of the symmetric group Sn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_n$$\end{document}, and two vertices α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document} and β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document} are adjacent in this graph iff there is some transposition (i, j) such that α=(i,j)β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha =(i,j) \beta $$\end{document}. Thus, the complete transposition graph is the Cayley graph Cay(Sn,S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathop {\mathrm {Cay}}\nolimits (S_n,S)$$\end{document} of the symmetric group generated by the set S of all transpositions. An open problem in the literature is to determine which Cayley graphs are normal. It was shown recently that the Cayley graph generated by four cyclically adjacent transpositions is non-normal. In the present paper, it is proved that the complete transposition graph is not a normal Cayley graph, for all n≥3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n \ge 3$$\end{document}. Furthermore, the automorphism group of the complete transposition graph is shown to equal Aut(Cay(Sn,S))=(R(Sn)⋊Inn(Sn))⋊Z2,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mathop {\mathrm {Aut}}\nolimits (\mathop {\mathrm {Cay}}\nolimits (S_n,S)) = (R(S_n) \rtimes \mathop {\mathrm {Inn}}\nolimits (S_n)) \rtimes \mathbb {Z}_2, \end{aligned}$$\end{document}where R(Sn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R(S_n)$$\end{document} is the right regular representation of Sn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_n$$\end{document}, Inn(Sn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathop {\mathrm {Inn}}\nolimits (S_n)$$\end{document} is the group of inner automorphisms of Sn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_n$$\end{document}, and Z2=⟨h⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {Z}_2 = \langle h \rangle $$\end{document}, where h is the map α↦α-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha \mapsto \alpha ^{-1}$$\end{document}.
引用
收藏
页码:793 / 801
页数:8
相关论文
共 50 条
  • [41] The conjugacy problem for the automorphism group of the random graph
    Coskey, Samuel
    Ellis, Paul
    Schneider, Scott
    ARCHIVE FOR MATHEMATICAL LOGIC, 2011, 50 (1-2) : 215 - 221
  • [42] Automorphism group of the reduced power (di)graph of a finite group
    Anitha, T.
    Rajkumar, R.
    COMMUNICATIONS IN ALGEBRA, 2025, 53 (02) : 687 - 703
  • [43] The full automorphism group of the power (di)graph of a finite group
    Feng, Min
    Ma, Xuanlong
    Wang, Kaishun
    EUROPEAN JOURNAL OF COMBINATORICS, 2016, 52 : 197 - 206
  • [44] Complete toric varieties with reductive automorphism group
    Nill, B
    MATHEMATISCHE ZEITSCHRIFT, 2006, 252 (04) : 767 - 786
  • [45] On orbits of the automorphism group on a complete toric variety
    Bazhov, Ivan
    BEITRAGE ZUR ALGEBRA UND GEOMETRIE-CONTRIBUTIONS TO ALGEBRA AND GEOMETRY, 2013, 54 (02): : 471 - 481
  • [46] Complete toric varieties with reductive automorphism group
    Benjamin Nill
    Mathematische Zeitschrift, 2006, 252 : 767 - 786
  • [47] The Complete Affine Automorphism Group of Polar Codes
    Li, Yuan
    Zhang, Huazi
    Li, Rong
    Wang, Jun
    Tong, Wen
    Yan, Guiying
    Ma, Zhiming
    2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
  • [48] New exact and heuristic algorithms for graph automorphism group and graph isomorphism
    Stoichev S.D.
    ACM Journal of Experimental Algorithmics, 2019, 24 (01):
  • [49] Relating complete and partial solution for problems similar to graph automorphism
    Nagoya, Takayuki
    Toda, Seinosuke
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 584 - +
  • [50] On automorphism group of orthogonality graph of finite semisimple rings
    Ou, Shikun
    Ren, Dehan
    Liu, Hailin
    Wong, Dein
    COMMUNICATIONS IN ALGEBRA, 2022, 50 (05) : 2233 - 2249