{"title":"具有固定最小特征值的正则图的结构理论","authors":"Qianqian Yang , Jack H. Koolen","doi":"10.1016/j.laa.2025.05.013","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper we will give a structure theory for regular graphs with fixed smallest eigenvalue. As a consequence of this theory, we show that a <em>k</em>-regular graph with smallest eigenvalue at least −<em>λ</em> has clique number linear in <em>k</em> if <em>k</em> is large with respect to <em>λ</em>.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"722 ","pages":"Pages 114-124"},"PeriodicalIF":1.0000,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A structure theory for regular graphs with fixed smallest eigenvalue\",\"authors\":\"Qianqian Yang , Jack H. Koolen\",\"doi\":\"10.1016/j.laa.2025.05.013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper we will give a structure theory for regular graphs with fixed smallest eigenvalue. As a consequence of this theory, we show that a <em>k</em>-regular graph with smallest eigenvalue at least −<em>λ</em> has clique number linear in <em>k</em> if <em>k</em> is large with respect to <em>λ</em>.</div></div>\",\"PeriodicalId\":18043,\"journal\":{\"name\":\"Linear Algebra and its Applications\",\"volume\":\"722 \",\"pages\":\"Pages 114-124\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Linear Algebra and its Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0024379525002277\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Linear Algebra and its Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0024379525002277","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
A structure theory for regular graphs with fixed smallest eigenvalue
In this paper we will give a structure theory for regular graphs with fixed smallest eigenvalue. As a consequence of this theory, we show that a k-regular graph with smallest eigenvalue at least −λ has clique number linear in k if k is large with respect to λ.
期刊介绍:
Linear Algebra and its Applications publishes articles that contribute new information or new insights to matrix theory and finite dimensional linear algebra in their algebraic, arithmetic, combinatorial, geometric, or numerical aspects. It also publishes articles that give significant applications of matrix theory or linear algebra to other branches of mathematics and to other sciences. Articles that provide new information or perspectives on the historical development of matrix theory and linear algebra are also welcome. Expository articles which can serve as an introduction to a subject for workers in related areas and which bring one to the frontiers of research are encouraged. Reviews of books are published occasionally as are conference reports that provide an historical record of major meetings on matrix theory and linear algebra.