Characterizing Graphs with Nullity n-4

IF 2.9 2区 化学 Q2 CHEMISTRY, MULTIDISCIPLINARY Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2023-01-01 DOI:10.46793/match.89-3.631p
R. Poojary, A. Bhat K, M. Karantha, S. Arumugam, I. Gutman
{"title":"Characterizing Graphs with Nullity n-4","authors":"R. Poojary, A. Bhat K, M. Karantha, S. Arumugam, I. Gutman","doi":"10.46793/match.89-3.631p","DOIUrl":null,"url":null,"abstract":"The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in the spectrum of G. A unified approach is presented for the characterization of graphs of order n with η(G) = n−4. All known results on trees, unicyclic graphs, bicyclic graphs, graphs with minimum degree 1, and r-partite graphs, for which η(G) = n−4 are shown to be corollaries of a theorem of Chang, Huang and Yeh that characterizes all graphs with nullity n − 4.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"64 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.46793/match.89-3.631p","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in the spectrum of G. A unified approach is presented for the characterization of graphs of order n with η(G) = n−4. All known results on trees, unicyclic graphs, bicyclic graphs, graphs with minimum degree 1, and r-partite graphs, for which η(G) = n−4 are shown to be corollaries of a theorem of Chang, Huang and Yeh that characterizes all graphs with nullity n − 4.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有零值n-4的图的表征
图G的零,用η(G)表示,是图G谱中特征值零的多重性。给出了n阶图的统一表征方法,η(G) = n−4。对于η(G) = n−4的树、单环图、双环图、最小度为1的图和r-部图,所有已知的结果都证明了Chang、Huang和Yeh的一个定理的推论,该定理刻画了所有零为n−4的图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
相关文献
[Antibiotic treatment of urinary tract infections in hospitalized children].
IF 0 Schweizerische medizinische WochenschriftPub Date : 1995-02-11 DOI:
M G Bianchetti, D Markus-Vecerova, U B Schaad
Urinary tract infections in hospitalized patients.
Gabriela Estefanía Peñaranda, David Francisco Suasnabar, Esteban Foia, Malena Finello, María Fabiana Ellena Leon, Ana Panchuk, Fernando Dominella, Daniela Hernandez, María Aldana Cometto, Sofía Mariela Vázquez, Tomás Amuchástegui, Ricardo Arturo Albertini, Emanuel José Saad
来源期刊
CiteScore
4.40
自引率
26.90%
发文量
71
审稿时长
2 months
期刊介绍: MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.
期刊最新文献
ChemCNet: An Explainable Integrated Model for Intelligent Analyzing Chemistry Synthesis Reactions Asymptotic Distribution of Degree-Based Topological Indices Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs Sombor Index of Hypergraphs The ABC Index Conundrum's Complete Solution
×
引用
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