Edge-transitive core-free Nest graphs

IF 0.6 3区 数学 Q3 MATHEMATICS Ars Mathematica Contemporanea Pub Date : 2023-09-15 DOI:10.26493/1855-3974.2944.9cd
István Kovács
{"title":"Edge-transitive core-free Nest graphs","authors":"István Kovács","doi":"10.26493/1855-3974.2944.9cd","DOIUrl":null,"url":null,"abstract":"A finite simple graph Γ is called a Nest graph if it is regular of valency 6 and admits an automorphism ρ with two orbits of the same length such that at least one of the subgraphs induced by these orbits is a cycle. We say that Γ is core-free if no non-trivial subgroup of the group generated by ρ is normal in Aut(Γ). In this paper, we show that, if Γ is edge-transitive and core-free, then it is isomorphic to one of the following graphs: the complement of the Petersen graph, the Hamming graph H(2,4), the Shrikhande graph and a certain normal 2-cover of K3, 3 by ℤ24.","PeriodicalId":49239,"journal":{"name":"Ars Mathematica Contemporanea","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Mathematica Contemporanea","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/1855-3974.2944.9cd","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

Abstract

A finite simple graph Γ is called a Nest graph if it is regular of valency 6 and admits an automorphism ρ with two orbits of the same length such that at least one of the subgraphs induced by these orbits is a cycle. We say that Γ is core-free if no non-trivial subgroup of the group generated by ρ is normal in Aut(Γ). In this paper, we show that, if Γ is edge-transitive and core-free, then it is isomorphic to one of the following graphs: the complement of the Petersen graph, the Hamming graph H(2,4), the Shrikhande graph and a certain normal 2-cover of K3, 3 by ℤ24.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无核边缘传递的巢图
一个有限简单图Γ如果它是价为6的正则图,并且允许两个相同长度的轨道的自同构ρ,使得由这些轨道引起的子图中至少有一个是循环,则称为巢图。如果在Aut(Γ)中由ρ生成的群中没有非平凡子群是正常的,我们说Γ是无核的。本文证明,如果Γ是边传递且无核的,则它同构于下列图之一:Petersen图、Hamming图H(2,4)、Shrikhande图的补和k3,3的某法线2-覆盖。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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