DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST

Q3 Mathematics Ural Mathematical Journal Pub Date : 2020-12-26 DOI:10.15826/umj.2020.2.006
K. S. Efimov, A. Makhnev
{"title":"DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST","authors":"K. S. Efimov, A. Makhnev","doi":"10.15826/umj.2020.2.006","DOIUrl":null,"url":null,"abstract":"In the class of distance-regular graphs of diameter 3 there are 5 intersection arrays of graphs with at most 28 vertices and noninteger eigenvalue. These arrays are \\(\\{18,14,5;1,2,14\\}\\), \\(\\{18,15,9;1,1,10\\}\\), \\(\\{21,16,10;1,2,12\\}\\), \\(\\{24,21,3;1,3,18\\}\\), and \\(\\{27,20,7;1,4,21\\}\\). Automorphisms of graphs with intersection arrays \\(\\{18,15,9;1,1,10\\}\\) and \\(\\{24,21,3;1,3,18\\}\\) were found earlier by A.A. Makhnev and D.V. Paduchikh. In this paper, it is proved that a graph with the intersection array \\(\\{27,20,7;1,4,21\\}\\) does not exist.","PeriodicalId":36805,"journal":{"name":"Ural Mathematical Journal","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ural Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15826/umj.2020.2.006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 2

Abstract

In the class of distance-regular graphs of diameter 3 there are 5 intersection arrays of graphs with at most 28 vertices and noninteger eigenvalue. These arrays are \(\{18,14,5;1,2,14\}\), \(\{18,15,9;1,1,10\}\), \(\{21,16,10;1,2,12\}\), \(\{24,21,3;1,3,18\}\), and \(\{27,20,7;1,4,21\}\). Automorphisms of graphs with intersection arrays \(\{18,15,9;1,1,10\}\) and \(\{24,21,3;1,3,18\}\) were found earlier by A.A. Makhnev and D.V. Paduchikh. In this paper, it is proved that a graph with the intersection array \(\{27,20,7;1,4,21\}\) does not exist.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有交数组{27,20,7;1,4,21}的距离正则图不存在
在直径为3的距离正则图类中,有5个图的交集数组,最多有28个顶点和非整数特征值。这些数组分别是\(\{18,14,5;1,2,14\}\)、\(\}18,15,9;1,1,10\})、\{21,16,10;1,2,12\}\}、\({24,21,3;1,3,18\}\)和\(\ \{27,20,7;1,4,21\})。具有交数组\(18,15,9;1,1,10\)和\(24,21,3;1,3,18\)的图的自同构是A.A.Makhnev和D.V.Paduchikh较早发现的。本文证明了具有交数组(27,20,7;1,4,21\)的图不存在。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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