最多有21个顶点的严格Deza图的枚举

IF 0.5 Q4 MATHEMATICS

Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya Pub Date : 2021-02-21 DOI:10.33048/semi.2021.18.107

S. Goryainov, Dmitry Panasenko, L. Shalaginov

{"title":"最多有21个顶点的严格Deza图的枚举","authors":"S. Goryainov, Dmitry Panasenko, L. Shalaginov","doi":"10.33048/semi.2021.18.107","DOIUrl":null,"url":null,"abstract":"A Deza graph Γ with parameters ( v , k , b , a ) is a k -regular graph with v vertices such that any two distinct vertices have b or a common neighbours, where b > a . A Deza graph of diameter 2 which is not a strongly regular graph is called a strictly Deza graph. We ﬁnd all 139 strictly Deza graphs up to 21 vertices and list corresponding constructions and properties.","PeriodicalId":45858,"journal":{"name":"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya","volume":" ","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2021-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Enumeration of strictly Deza graphs with at most 21 vertices\",\"authors\":\"S. Goryainov, Dmitry Panasenko, L. Shalaginov\",\"doi\":\"10.33048/semi.2021.18.107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Deza graph Γ with parameters ( v , k , b , a ) is a k -regular graph with v vertices such that any two distinct vertices have b or a common neighbours, where b > a . A Deza graph of diameter 2 which is not a strongly regular graph is called a strictly Deza graph. We ﬁnd all 139 strictly Deza graphs up to 21 vertices and list corresponding constructions and properties.\",\"PeriodicalId\":45858,\"journal\":{\"name\":\"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2021-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33048/semi.2021.18.107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33048/semi.2021.18.107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 1

摘要

参数为（v，k，b，A）的Deza图Γ是一个具有v个顶点的k-正则图，使得任何两个不同的顶点都有b或一个公共邻居，其中b>A。直径为2的Deza图不是强正则图，称为严格Deza图。我们定义了所有139个严格的Deza图，最多21个顶点，并列出了相应的构造和性质。

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

查看原文本刊更多论文

Enumeration of strictly Deza graphs with at most 21 vertices

A Deza graph Γ with parameters ( v , k , b , a ) is a k -regular graph with v vertices such that any two distinct vertices have b or a common neighbours, where b > a . A Deza graph of diameter 2 which is not a strongly regular graph is called a strictly Deza graph. We ﬁnd all 139 strictly Deza graphs up to 21 vertices and list corresponding constructions and properties.

求助全文

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

来源期刊

Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya MATHEMATICS-

CiteScore

1.00

自引率

25.00%

发文量