一些Cayley图的最大零度

IF 0.1 Q4 MATHEMATICS
E. Vatandoost, Y. Golkhandy Pour
{"title":"一些Cayley图的最大零度","authors":"E. Vatandoost, Y. Golkhandy Pour","doi":"10.1080/25742558.2018.1462658","DOIUrl":null,"url":null,"abstract":"Abstract Recently, the nullity, the algebraic multiplicity of the number zero in the spectrum of the adjacency matrix, of a molecular graph has received a lot of attention as it has a number of direct applications in organic chemistry. In this regard, many researchers have been trying to find an upper or lower bound for the maximum nullity (minimum rank), (), for a graph . In this paper, using a well-known result, which presents the spectrum of a Cayley graph in terms of irreducible characters of the underlying group, and using representation and character of groups, we give a lower bound for the maximum nullity of Cayley graph, , where is a cyclic group, or such that is a cyclic group and is an arbitrary finite group, for , with determine the spectrum of Cayley graphs.","PeriodicalId":92618,"journal":{"name":"Cogent mathematics & statistics","volume":null,"pages":null},"PeriodicalIF":0.1000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/25742558.2018.1462658","citationCount":"1","resultStr":"{\"title\":\"Maximum nullity of some Cayley graphs\",\"authors\":\"E. Vatandoost, Y. Golkhandy Pour\",\"doi\":\"10.1080/25742558.2018.1462658\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Recently, the nullity, the algebraic multiplicity of the number zero in the spectrum of the adjacency matrix, of a molecular graph has received a lot of attention as it has a number of direct applications in organic chemistry. In this regard, many researchers have been trying to find an upper or lower bound for the maximum nullity (minimum rank), (), for a graph . In this paper, using a well-known result, which presents the spectrum of a Cayley graph in terms of irreducible characters of the underlying group, and using representation and character of groups, we give a lower bound for the maximum nullity of Cayley graph, , where is a cyclic group, or such that is a cyclic group and is an arbitrary finite group, for , with determine the spectrum of Cayley graphs.\",\"PeriodicalId\":92618,\"journal\":{\"name\":\"Cogent mathematics & statistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/25742558.2018.1462658\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cogent mathematics & statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/25742558.2018.1462658\",\"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":"Cogent mathematics & statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/25742558.2018.1462658","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

摘要

摘要近年来,分子图邻接矩阵谱中数字为零的代数多重性由于在有机化学中有许多直接的应用而受到了广泛的关注。在这方面,许多研究者一直在试图寻找图的最大零度(最小秩)()的上界或下界。本文利用下面群的不可约特征来表示Cayley图的谱的一个著名结果,利用群的表示和特征,给出Cayley图的极大零值的下界,其中是一个循环群,或者是一个循环群并且是任意有限群,因为,用确定Cayley图的谱。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Maximum nullity of some Cayley graphs
Abstract Recently, the nullity, the algebraic multiplicity of the number zero in the spectrum of the adjacency matrix, of a molecular graph has received a lot of attention as it has a number of direct applications in organic chemistry. In this regard, many researchers have been trying to find an upper or lower bound for the maximum nullity (minimum rank), (), for a graph . In this paper, using a well-known result, which presents the spectrum of a Cayley graph in terms of irreducible characters of the underlying group, and using representation and character of groups, we give a lower bound for the maximum nullity of Cayley graph, , where is a cyclic group, or such that is a cyclic group and is an arbitrary finite group, for , with determine the spectrum of Cayley graphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
13 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信