具有零值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":"具有零值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":null,"pages":null},"PeriodicalIF":2.9000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":null,\"pages\":null},\"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}","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

摘要

图G的零，用η(G)表示，是图G谱中特征值零的多重性。给出了n阶图的统一表征方法，η(G) = n−4。对于η(G) = n−4的树、单环图、双环图、最小度为1的图和r-部图，所有已知的结果都证明了Chang、Huang和Yeh的一个定理的推论，该定理刻画了所有零为n−4的图。

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

查看原文本刊更多论文

Characterizing Graphs with Nullity n-4

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.

求助全文

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

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

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.