ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS

Q3 Mathematics Ural Mathematical Journal Pub Date : 2021-12-30 DOI:10.15826/umj.2021.2.010
L. Tsiovkina
{"title":"ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS","authors":"L. Tsiovkina","doi":"10.15826/umj.2021.2.010","DOIUrl":null,"url":null,"abstract":"The paper is devoted to the problem of classification of edge-transitive distance-regular antipodal covers of complete graphs. This extends the classification of those covers that are arc-transitive, which has been settled except for some tricky cases that remain to be considered, including the case of covers satisfying condition \\(c_2=1\\) (which means that every two vertices at distance 2  have exactly one common neighbour).Here it is shown that an edge-transitive distance-regular antipodal cover of a complete graph with \\(c_2=1\\) is either the second neighbourhood of a vertex in a Moore graph of valency 3 or 7, or a Mathon graph, or a half-transitive graph whose automorphism group induces an affine  \\(2\\)-homogeneous group on the set of its fibres. Moreover,  distance-regular  antipodal covers of complete graphs  with \\(c_2=1\\) that admit  an automorphism group acting  \\(2\\)-homogeneously on the set of fibres (which turns out to be an approximation of the property of edge-transitivity  of such  cover), are described.   A well-known correspondence between distance-regular antipodal covers of complete graphs with \\(c_2=1\\) and geodetic graphs of diameter two that can be viewed as underlying graphs of certain Moore geometries, allows us to effectively restrict admissible automorphism groups of covers under consideration by combining Kantor's classification of involutory automorphisms of these geometries together with the classification of finite 2-homogeneous permutation groups.","PeriodicalId":36805,"journal":{"name":"Ural Mathematical Journal","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ural Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15826/umj.2021.2.010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

Abstract

The paper is devoted to the problem of classification of edge-transitive distance-regular antipodal covers of complete graphs. This extends the classification of those covers that are arc-transitive, which has been settled except for some tricky cases that remain to be considered, including the case of covers satisfying condition \(c_2=1\) (which means that every two vertices at distance 2  have exactly one common neighbour).Here it is shown that an edge-transitive distance-regular antipodal cover of a complete graph with \(c_2=1\) is either the second neighbourhood of a vertex in a Moore graph of valency 3 or 7, or a Mathon graph, or a half-transitive graph whose automorphism group induces an affine  \(2\)-homogeneous group on the set of its fibres. Moreover,  distance-regular  antipodal covers of complete graphs  with \(c_2=1\) that admit  an automorphism group acting  \(2\)-homogeneously on the set of fibres (which turns out to be an approximation of the property of edge-transitivity  of such  cover), are described.   A well-known correspondence between distance-regular antipodal covers of complete graphs with \(c_2=1\) and geodetic graphs of diameter two that can be viewed as underlying graphs of certain Moore geometries, allows us to effectively restrict admissible automorphism groups of covers under consideration by combining Kantor's classification of involutory automorphisms of these geometries together with the classification of finite 2-homogeneous permutation groups.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
完备图的一类边传递距离正则对映盖
本文研究了完全图的边传递距离正则对足覆盖的分类问题。这扩展了弧传递覆盖的分类,除了一些有待考虑的棘手情况外,弧传递覆盖已经得到解决,包括覆盖满足条件\(c_2=1\)(这意味着距离2处的每两个顶点恰好有一个公共邻域)的情况。本文证明了具有\(c_0=1\)的完备图的边传递距离正则对足覆盖是价为3或7的Moore图或Mathon图中顶点的第二邻域,或半传递图,其自同构群在其纤维集上诱导仿射(2)-齐群。此外,还描述了具有\(c_2=1\)的完备图的距离正则对足覆盖,它允许自同构群\(2\)-均匀地作用于纤维集(这是这种覆盖的边传递性性质的近似)。具有\(c_2=1\)的完备图的距离正则对足覆盖与直径为2的大地测量图之间的一个众所周知的对应关系,可以看作某些Moore几何的基础图,通过将Kantor对这些几何的对合自同构的分类与有限2-同胚置换群的分类相结合,允许我们有效地限制所考虑的覆盖的可容许自同构群。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Ural Mathematical Journal
Ural Mathematical Journal Mathematics-Mathematics (all)
CiteScore
1.30
自引率
0.00%
发文量
12
审稿时长
16 weeks
期刊最新文献
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM STATISTICAL CONVERGENCE IN A BICOMPLEX VALUED METRIC SPACE YERS–ULAM–RASSIAS STABILITY OF NONLINEAR DIFFERENTIAL EQUATIONS WITH A GENERALIZED ACTIONS ON THE RIGHT-HAND SIDE ON NEW HYBRID ROOT-FINDING ALGORITHMS FOR SOLVING TRANSCENDENTAL EQUATIONS USING EXPONENTIAL AND HALLEY'S METHODS THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM
×
引用
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