Characterization of strongly regular integral circulant graphs by spectral approach

IF 1 4区 数学 Q1 MATHEMATICS Applicable Analysis and Discrete Mathematics Pub Date : 2022-01-01 DOI:10.2298/aadm180713023b
Milan Basic
{"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}
引用次数: 3

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用谱法刻画强正则积分循环图
积分循环图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.
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Applicable Analysis and Discrete Mathematics
Applicable Analysis and Discrete Mathematics MATHEMATICS, APPLIED-MATHEMATICS
CiteScore
2.40
自引率
11.10%
发文量
34
审稿时长
>12 weeks
期刊介绍: 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/).
期刊最新文献
New sharp inequalities of Mitrinovic-Adamovic type Complete monotonicity involving the divided difference of polygamma functions The relationship between Huygens’ and Wilker’s inequalities and further remarks New family of Jacobi-Stirling numbers Applications of the generalized function-to-sequence transform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1