On Graphs in Which the Neighborhoods of Vertices Are Edge-Regular Graphs without 3-Claws

IF 0.4 4区数学 Q4 MATHEMATICS

Proceedings of the Steklov Institute of Mathematics Pub Date : 2023-12-01 DOI:10.1134/s0081543823060044

{"title":"On Graphs in Which the Neighborhoods of Vertices Are Edge-Regular Graphs without 3-Claws","authors":"","doi":"10.1134/s0081543823060044","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> The triangle-free Krein graph Kre \\((r)\\) is strongly regular with parameters \\(((r^{2}+3r)^{2},\\) \\(r^{3}+3r^{2}+r,0,r^{2}+r)\\) . The existence of such graphs is known only for \\(r=1\\) (the complement of the Clebsch graph) and \\(r=2\\) (the Higman–Sims graph). A.L. Gavrilyuk and A.A. Makhnev proved that the graph Kre \\((3)\\) does not exist. Later Makhnev proved that the graph Kre \\((4)\\) does not exist. The graph Kre \\((r)\\) is the only strongly regular triangle-free graph in which the antineighborhood of a vertex Kre \\((r)^{\\prime}\\) is strongly regular. The graph Kre \\((r)^{\\prime}\\) has parameters \\(((r^{2}+2r-1)(r^{2}+3r+1),r^{3}+2r^{2},0,r^{2})\\) . This work clarifies Makhnev’s result on graphs in which the neighborhoods of vertices are strongly regular graphs without \\(3\\) -cocliques. As a consequence, it is proved that the graph Kre \\((r)\\) exists if and only if the graph Kre \\((r)^{\\prime}\\) exists and is the complement of the block graph of a quasi-symmetric \\(2\\) -design. ","PeriodicalId":54557,"journal":{"name":"Proceedings of the Steklov Institute of Mathematics","volume":"13 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Steklov Institute of Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1134/s0081543823060044","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

Abstract

The triangle-free Krein graph Kre \((r)\) is strongly regular with parameters \(((r^{2}+3r)^{2},\) \(r^{3}+3r^{2}+r,0,r^{2}+r)\) . The existence of such graphs is known only for \(r=1\) (the complement of the Clebsch graph) and \(r=2\) (the Higman–Sims graph). A.L. Gavrilyuk and A.A. Makhnev proved that the graph Kre \((3)\) does not exist. Later Makhnev proved that the graph Kre \((4)\) does not exist. The graph Kre \((r)\) is the only strongly regular triangle-free graph in which the antineighborhood of a vertex Kre \((r)^{\prime}\) is strongly regular. The graph Kre \((r)^{\prime}\) has parameters \(((r^{2}+2r-1)(r^{2}+3r+1),r^{3}+2r^{2},0,r^{2})\) . This work clarifies Makhnev’s result on graphs in which the neighborhoods of vertices are strongly regular graphs without \(3\) -cocliques. As a consequence, it is proved that the graph Kre \((r)\) exists if and only if the graph Kre \((r)^{\prime}\) exists and is the complement of the block graph of a quasi-symmetric \(2\) -design.

查看原文本刊更多论文

论顶点邻域为无三爪边缘规则图的图

Abstract The triangle-free Krein graph Kre \((r)\) is strongly regular with parameters \(((r^{2}+3r)^{2},\) . \(r^{3}+3r^{2}+r,0,r^{2}+r)\) .我们只知道 \(r=1\)（克莱布什图的补集）和 \(r=2\)（希格曼-西姆斯图）存在这样的图。A.L. Gavrilyuk 和 A.A. Makhnev 证明了 Kre\((3)\) 图并不存在。后来马赫涅夫又证明了 Kre （(4)）图不存在。图 Kre （(r)）是唯一的强正则无三角形图，其中顶点 Kre （(r)^{\prime}\）的反邻域是强正则的。图 Kre \((r)^{\prime}\) 的参数是 \(((r^{2}+2r-1)(r^{2}+3r+1),r^{3}+2r^{2},0,r^{2})\)。这项工作澄清了马赫涅夫关于顶点邻域为不含\(3\) -楔的强规则图的结果。结果证明，当且仅当图 Kre \((r)^{\prime}\) 存在并且是准对称 \(2\) -设计的块图的补集时，图 Kre \((r)\) 才存在。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the Steklov Institute of Mathematics MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

0.90

自引率

20.00%

发文量

审稿时长

4-8 weeks

期刊介绍： Proceedings of the Steklov Institute of Mathematics is a cover-to-cover translation of the Trudy Matematicheskogo Instituta imeni V.A. Steklova of the Russian Academy of Sciences. Each issue ordinarily contains either one book-length article or a collection of articles pertaining to the same topic.