Normal Cayley digraphs of dihedral groups with CI-property

IF 0.6 3区 数学 Q3 MATHEMATICS Ars Mathematica Contemporanea Pub Date : 2021-05-27 DOI:10.26493/1855-3974.2688.2de
Jingnan Xie, Yan-Quan Feng, Jin-Xin Zhou
{"title":"Normal Cayley digraphs of dihedral groups with CI-property","authors":"Jingnan Xie, Yan-Quan Feng, Jin-Xin Zhou","doi":"10.26493/1855-3974.2688.2de","DOIUrl":null,"url":null,"abstract":"A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to $S$ is said to be normal if the right regular representation of $G$ is normal in the automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if there is $\\alpha\\in Aut(G)$ such that $S^\\alpha=T$, whenever $Cay(G,S)\\cong Cay(G,T)$ for a Cayley (di)graph $Cay(G,T)$. A finite group $G$ is called a DCI-group or a NDCI-group if all Cayley digraphs or normal Cayley digraphs of $G$ are CI-digraphs, and is called a CI-group or a NCI-group if all Cayley graphs or normal Cayley graphs of $G$ are CI-graphs, respectively. Motivated by a conjecture proposed by \\'Ad\\'am in 1967, CI-groups and DCI-groups have been actively studied during the last fifty years by many researchers in algebraic graph theory. It takes about thirty years to obtain the classification of cyclic CI-groups and DCI-groups, and recently, the first two authors, among others, classified cyclic NCI-groups and NDCI-groups. Even though there are many partial results on dihedral CI-groups and DCI-groups, their classification is still elusive. In this paper, we prove that a dihedral group of order $2n$ is a NCI-group or a NDCI-group if and only if $n=2,4$ or $n$ is odd. As a direct consequence, we have that if a dihedral group $D_{2n}$ of order $2n$ is a DCI-group then $n=2$ or $n$ is odd-square-free, and that if $D_{2n}$ is a CI-group then $n=2,9$ or $n$ is odd-square-free, throwing some new light on classification of dihedral CI-groups and DCI-groups.","PeriodicalId":49239,"journal":{"name":"Ars Mathematica Contemporanea","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2021-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Mathematica Contemporanea","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.26493/1855-3974.2688.2de","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to $S$ is said to be normal if the right regular representation of $G$ is normal in the automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if there is $\alpha\in Aut(G)$ such that $S^\alpha=T$, whenever $Cay(G,S)\cong Cay(G,T)$ for a Cayley (di)graph $Cay(G,T)$. A finite group $G$ is called a DCI-group or a NDCI-group if all Cayley digraphs or normal Cayley digraphs of $G$ are CI-digraphs, and is called a CI-group or a NCI-group if all Cayley graphs or normal Cayley graphs of $G$ are CI-graphs, respectively. Motivated by a conjecture proposed by \'Ad\'am in 1967, CI-groups and DCI-groups have been actively studied during the last fifty years by many researchers in algebraic graph theory. It takes about thirty years to obtain the classification of cyclic CI-groups and DCI-groups, and recently, the first two authors, among others, classified cyclic NCI-groups and NDCI-groups. Even though there are many partial results on dihedral CI-groups and DCI-groups, their classification is still elusive. In this paper, we prove that a dihedral group of order $2n$ is a NCI-group or a NDCI-group if and only if $n=2,4$ or $n$ is odd. As a direct consequence, we have that if a dihedral group $D_{2n}$ of order $2n$ is a DCI-group then $n=2$ or $n$ is odd-square-free, and that if $D_{2n}$ is a CI-group then $n=2,9$ or $n$ is odd-square-free, throwing some new light on classification of dihedral CI-groups and DCI-groups.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有ci -性质的二面体群的正规Cayley有向图
Cayley (di)图 $Cay(G,S)$ 一组的 $G$ 关于 $S$ 如果说正态如果是正确的正则表示 $G$ 的自同构群中的正规是 $Cay(G,S)$,若有,则称为CI-(di)图 $\alpha\in Aut(G)$ 这样 $S^\alpha=T$,每当 $Cay(G,S)\cong Cay(G,T)$ 对于Cayley (di)图 $Cay(G,T)$. 有限群 $G$ 被称为dci群或ndgi群如果所有的Cayley有向图或正常的Cayley有向图 $G$ 都是ci -有向图,它被称为ci -群或nci -群如果所有的Cayley图或正规Cayley图是 $G$ 分别为ci图。在1967年Ádám提出的一个猜想的推动下,ci -群和dci -群在过去的五十年里被许多代数图论研究者积极地研究。环状ci -群和dci -群的分类历经了大约30年的时间,最近,前两位作者等对环状nci -群和ndci -群进行了分类。尽管对二面体ci群和dci群有许多不完全的结果,但它们的分类仍然难以确定。本文证明了一个有序的二面体群 $2n$ 是nci组还是nci组当且仅当 $n=2,4$ 或 $n$ 很奇怪。直接的结果是,如果是一个二面体基团 $D_{2n}$ 有序的 $2n$ 那是dci组吗 $n=2$ 或 $n$ 奇平方是自由的,是吗 $D_{2n}$ 那是ci组吗 $n=2,9$ 或 $n$ 是奇方无的,这为二面体ci群和dci群的分类提供了一些新的线索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Ars Mathematica Contemporanea
Ars Mathematica Contemporanea MATHEMATICS, APPLIED-MATHEMATICS
CiteScore
1.70
自引率
0.00%
发文量
45
审稿时长
>12 weeks
期刊介绍: Ars mathematica contemporanea will publish high-quality articles in contemporary mathematics that arise from the discrete and concrete mathematics paradigm. It will favor themes that combine at least two different fields of mathematics. In particular, we welcome papers intersecting discrete mathematics with other branches of mathematics, such as algebra, geometry, topology, theoretical computer science, and combinatorics. The name of the journal was chosen carefully. Symmetry is certainly a theme that is quite welcome to the journal, as it is through symmetry that mathematics comes closest to art.
期刊最新文献
Perfect matching cuts partitioning a graph into complementary subgraphs Spectra of signed graphs and related oriented graphs Distance-regular Cayley graphs over Zpˢ+Zp Answers to questions about medial layer graphs of self-dual regular and chiral polytopes On the metric subgraphs of a graph
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1