{"title":"具有固定顶点和边数的星形图邻接矩阵的首特征值","authors":"William D. Fries, Miaohua Jiang","doi":"10.1080/25742558.2019.1628513","DOIUrl":null,"url":null,"abstract":"Abstract For a sequence of adjacency matrices, describing the unfolding of a network from the graph of a star, through graphs of a broom, to the graph of a link with constant vertices and edges, we show that the leading eigenvalue (the spectral radius) satisfies a simple algebraic equation. The equation allows easy numerical computation of the leading eigenvalue as well as a direct proof of its monotonicity in terms of the maximal degree of vertices.","PeriodicalId":92618,"journal":{"name":"Cogent mathematics & statistics","volume":" ","pages":""},"PeriodicalIF":0.1000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/25742558.2019.1628513","citationCount":"0","resultStr":"{\"title\":\"Leading eigenvalues of adjacency matrices of star-like graphs with fixed numbers of vertices and edges\",\"authors\":\"William D. Fries, Miaohua Jiang\",\"doi\":\"10.1080/25742558.2019.1628513\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract For a sequence of adjacency matrices, describing the unfolding of a network from the graph of a star, through graphs of a broom, to the graph of a link with constant vertices and edges, we show that the leading eigenvalue (the spectral radius) satisfies a simple algebraic equation. The equation allows easy numerical computation of the leading eigenvalue as well as a direct proof of its monotonicity in terms of the maximal degree of vertices.\",\"PeriodicalId\":92618,\"journal\":{\"name\":\"Cogent mathematics & statistics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/25742558.2019.1628513\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cogent mathematics & statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/25742558.2019.1628513\",\"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.2019.1628513","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
Leading eigenvalues of adjacency matrices of star-like graphs with fixed numbers of vertices and edges
Abstract For a sequence of adjacency matrices, describing the unfolding of a network from the graph of a star, through graphs of a broom, to the graph of a link with constant vertices and edges, we show that the leading eigenvalue (the spectral radius) satisfies a simple algebraic equation. The equation allows easy numerical computation of the leading eigenvalue as well as a direct proof of its monotonicity in terms of the maximal degree of vertices.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
