论小型严格诺伊迈尔图的存在

IF 0.6 4区数学 Q3 MATHEMATICS

Graphs and Combinatorics Pub Date : 2024-04-08 DOI:10.1007/s00373-024-02779-4

Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker

{"title":"论小型严格诺伊迈尔图的存在","authors":"Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker","doi":"10.1007/s00373-024-02779-4","DOIUrl":null,"url":null,"abstract":"<p>A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this work, we prove several results on the existence of small strictly Neumaier graphs. In particular, we present a theoretical proof of the uniqueness of the smallest strictly Neumaier graph with parameters (16, 9, 4; 2, 4), we establish the existence of a strictly Neumaier graph with parameters (25, 12, 5; 2, 5), and we disprove the existence of strictly Neumaier graphs with parameters (25, 16, 9; 3, 5), (28, 18, 11; 4, 7), (33, 24, 17; 6, 9), (35, 2212; 3, 5), (40, 30, 22; 7, 10) and (55, 34, 18; 3, 5). Our proofs use combinatorial techniques and a novel application of integer programming methods.\n</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"87 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Existence of Small Strictly Neumaier Graphs\",\"authors\":\"Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker\",\"doi\":\"10.1007/s00373-024-02779-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this work, we prove several results on the existence of small strictly Neumaier graphs. In particular, we present a theoretical proof of the uniqueness of the smallest strictly Neumaier graph with parameters (16, 9, 4; 2, 4), we establish the existence of a strictly Neumaier graph with parameters (25, 12, 5; 2, 5), and we disprove the existence of strictly Neumaier graphs with parameters (25, 16, 9; 3, 5), (28, 18, 11; 4, 7), (33, 24, 17; 6, 9), (35, 2212; 3, 5), (40, 30, 22; 7, 10) and (55, 34, 18; 3, 5). Our proofs use combinatorial techniques and a novel application of integer programming methods.\\n</p>\",\"PeriodicalId\":12811,\"journal\":{\"name\":\"Graphs and Combinatorics\",\"volume\":\"87 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graphs and Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00373-024-02779-4\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00373-024-02779-4","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

Neumaier 图是包含一个规则小块的非完整边规则图。在这项工作中，我们证明了关于小型严格 Neumaier 图存在性的几个结果。特别是，我们从理论上证明了参数为 (16, 9, 4; 2, 4) 的最小严格 Neumaier 图的唯一性；我们建立了参数为 (25, 12, 5. 2, 5) 的严格 Neumaier 图的存在性；我们反驳了参数为 (16, 9, 4; 2, 4) 的最小严格 Neumaier 图的唯一性；2，5），并反证了参数为 (25, 16, 9; 3, 5)、(28, 18, 11; 4, 7)、(33, 24, 17; 6, 9)、(35, 2212; 3, 5)、(40, 30, 22; 7, 10) 和 (55, 34, 18; 3, 5) 的严格诺伊迈尔图的存在性。我们的证明使用了组合技术和新颖的整数编程方法。

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

On the Existence of Small Strictly Neumaier Graphs

查看原文本刊更多论文

On the Existence of Small Strictly Neumaier Graphs

A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this work, we prove several results on the existence of small strictly Neumaier graphs. In particular, we present a theoretical proof of the uniqueness of the smallest strictly Neumaier graph with parameters (16, 9, 4; 2, 4), we establish the existence of a strictly Neumaier graph with parameters (25, 12, 5; 2, 5), and we disprove the existence of strictly Neumaier graphs with parameters (25, 16, 9; 3, 5), (28, 18, 11; 4, 7), (33, 24, 17; 6, 9), (35, 2212; 3, 5), (40, 30, 22; 7, 10) and (55, 34, 18; 3, 5). Our proofs use combinatorial techniques and a novel application of integer programming methods.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Graphs and Combinatorics 数学-数学

CiteScore

1.00

自引率

14.30%

发文量

160

审稿时长

6 months

期刊介绍： Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.