{"title":"图的代数连通性的上界","authors":"Zhen Lin, L. Miao","doi":"10.13001/ela.2022.5133","DOIUrl":null,"url":null,"abstract":"The algebraic connectivity of a connected graph $G$ is the second smallest eigenvalue of the Laplacian matrix of $G$. In this paper, some new upper bounds on algebraic connectivity are obtained by applying generalized interlacing to an appropriate quotient matrix.","PeriodicalId":50540,"journal":{"name":"Electronic Journal of Linear Algebra","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2022-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Upper bounds on the algebraic connectivity of graphs\",\"authors\":\"Zhen Lin, L. Miao\",\"doi\":\"10.13001/ela.2022.5133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The algebraic connectivity of a connected graph $G$ is the second smallest eigenvalue of the Laplacian matrix of $G$. In this paper, some new upper bounds on algebraic connectivity are obtained by applying generalized interlacing to an appropriate quotient matrix.\",\"PeriodicalId\":50540,\"journal\":{\"name\":\"Electronic Journal of Linear Algebra\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2022-01-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Linear Algebra\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.13001/ela.2022.5133\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Linear Algebra","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.13001/ela.2022.5133","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
Upper bounds on the algebraic connectivity of graphs
The algebraic connectivity of a connected graph $G$ is the second smallest eigenvalue of the Laplacian matrix of $G$. In this paper, some new upper bounds on algebraic connectivity are obtained by applying generalized interlacing to an appropriate quotient matrix.
期刊介绍：
The journal is essentially unlimited by size. Therefore, we have no restrictions on length of articles. Articles are submitted electronically. Refereeing of articles is conventional and of high standards. Posting of articles is immediate following acceptance, processing and final production approval.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
