{"title":"用谱法刻画强正则积分循环图","authors":"Milan Basic","doi":"10.2298/aadm180713023b","DOIUrl":null,"url":null,"abstract":"The integral circulant graph ICGn(D) has the vertex set Zn = {0, 1, 2, . . . , n? 1} and vertices a and b are adjacent if gcd(a ? b, n) ? D, where D ? Dn, Dn = {d : d | n, 1 ? d < n}. Motivated by the incorrect proof of a previously published result, in this paper we characterize the class of integral circulant graphs that are strongly regular. More precisely, connected ICGn(D) is strongly regular if and only if n is composite and D = {d ? Dn | m ? d} for some m | n and n ? 1 ? m ? 2.","PeriodicalId":51232,"journal":{"name":"Applicable Analysis and Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Characterization of strongly regular integral circulant graphs by spectral approach\",\"authors\":\"Milan Basic\",\"doi\":\"10.2298/aadm180713023b\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The integral circulant graph ICGn(D) has the vertex set Zn = {0, 1, 2, . . . , n? 1} and vertices a and b are adjacent if gcd(a ? b, n) ? D, where D ? Dn, Dn = {d : d | n, 1 ? d < n}. Motivated by the incorrect proof of a previously published result, in this paper we characterize the class of integral circulant graphs that are strongly regular. More precisely, connected ICGn(D) is strongly regular if and only if n is composite and D = {d ? Dn | m ? d} for some m | n and n ? 1 ? m ? 2.\",\"PeriodicalId\":51232,\"journal\":{\"name\":\"Applicable Analysis and Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applicable Analysis and Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2298/aadm180713023b\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Analysis and Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2298/aadm180713023b","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 3
摘要
积分循环图ICGn(D)的顶点集Zn ={0,1,2，…n ?如果gcd(a ?B, n) ?D，哪里D ?Dn, Dn = {d: d | n, 1 ?D < n}。基于先前发表的一个结果的错误证明，本文刻画了一类强正则的积分循环图。更准确地说，连通ICGn(D)是强正则的当且仅当n是复合且D = {D ?不是bbbbm吗?D}对于某个m b| n和n ?1 ？ m ?2.
Characterization of strongly regular integral circulant graphs by spectral approach
The integral circulant graph ICGn(D) has the vertex set Zn = {0, 1, 2, . . . , n? 1} and vertices a and b are adjacent if gcd(a ? b, n) ? D, where D ? Dn, Dn = {d : d | n, 1 ? d < n}. Motivated by the incorrect proof of a previously published result, in this paper we characterize the class of integral circulant graphs that are strongly regular. More precisely, connected ICGn(D) is strongly regular if and only if n is composite and D = {d ? Dn | m ? d} for some m | n and n ? 1 ? m ? 2.
期刊介绍：
Applicable Analysis and Discrete Mathematics is indexed, abstracted and cover-to cover reviewed in: Web of Science, Current Contents/Physical, Chemical & Earth Sciences (CC/PC&ES), Mathematical Reviews/MathSciNet, Zentralblatt für Mathematik, Referativny Zhurnal-VINITI. It is included Citation Index-Expanded (SCIE), ISI Alerting Service and in Digital Mathematical Registry of American Mathematical Society (http://www.ams.org/dmr/).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
