q-可除设计图和Deza图的类似物

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A Pub Date : 2025-04-03 DOI:10.1016/j.jcta.2025.106047

Dean Crnković , Maarten De Boeck , Francesco Pavese , Andrea Švob

{"title":"q-可除设计图和Deza图的类似物","authors":"Dean Crnković , Maarten De Boeck , Francesco Pavese , Andrea Švob","doi":"10.1016/j.jcta.2025.106047","DOIUrl":null,"url":null,"abstract":"<div><div>Divisible design graphs were introduced in 2011 by Haemers, Kharaghani and Meulenberg. In this paper, we introduce the notion of <em>q</em>-analogs of divisible design graphs and show that all <em>q</em>-analogs of divisible design graphs come from spreads, and are actually <em>q</em>-analogs of strongly regular graphs.</div><div>Deza graphs were introduced by Erickson, Fernando, Haemers, Hardy and Hemmeter in 1999. In this paper, we introduce <em>q</em>-analogs of Deza graphs. Further, we determine possible parameters, give examples of <em>q</em>-analogs of Deza graphs and characterize all non-strongly regular <em>q</em>-analogs of Deza graphs with the smallest parameters.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"215 ","pages":"Article 106047"},"PeriodicalIF":0.9000,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"q-Analogs of divisible design graphs and Deza graphs\",\"authors\":\"Dean Crnković , Maarten De Boeck , Francesco Pavese , Andrea Švob\",\"doi\":\"10.1016/j.jcta.2025.106047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Divisible design graphs were introduced in 2011 by Haemers, Kharaghani and Meulenberg. In this paper, we introduce the notion of <em>q</em>-analogs of divisible design graphs and show that all <em>q</em>-analogs of divisible design graphs come from spreads, and are actually <em>q</em>-analogs of strongly regular graphs.</div><div>Deza graphs were introduced by Erickson, Fernando, Haemers, Hardy and Hemmeter in 1999. In this paper, we introduce <em>q</em>-analogs of Deza graphs. Further, we determine possible parameters, give examples of <em>q</em>-analogs of Deza graphs and characterize all non-strongly regular <em>q</em>-analogs of Deza graphs with the smallest parameters.</div></div>\",\"PeriodicalId\":50230,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series A\",\"volume\":\"215 \",\"pages\":\"Article 106047\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series A\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0097316525000421\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316525000421","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

可分割设计图形是由Haemers、Kharaghani和Meulenberg在2011年引入的。本文引入了可分设计图的q-类似的概念，证明了所有可分设计图的q-类似都来自于扩展，并且实际上是强正则图的q-类似。Deza图是由Erickson、Fernando、Haemers、Hardy和Hemmeter于1999年提出的。本文引入了Deza图的q类。进一步，我们确定了可能的参数，给出了Deza图的q-类似的例子，并刻画了所有具有最小参数的Deza图的非强正则q-类似。

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

查看原文本刊更多论文

q-Analogs of divisible design graphs and Deza graphs

Divisible design graphs were introduced in 2011 by Haemers, Kharaghani and Meulenberg. In this paper, we introduce the notion of q-analogs of divisible design graphs and show that all q-analogs of divisible design graphs come from spreads, and are actually q-analogs of strongly regular graphs.

Deza graphs were introduced by Erickson, Fernando, Haemers, Hardy and Hemmeter in 1999. In this paper, we introduce q-analogs of Deza graphs. Further, we determine possible parameters, give examples of q-analogs of Deza graphs and characterize all non-strongly regular q-analogs of Deza graphs with the smallest parameters.

求助全文

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

来源期刊

Journal of Combinatorial Theory Series A 数学-数学

CiteScore

2.90

自引率

9.10%

发文量

审稿时长

12 months

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.