SPECTRAL RADIUS and AVERAGE 2-DEGREE SEQUENCE of A GRAPH

Yu Pei Huang, Chih Wen Weng

研究成果: Article同行評審

3 引文 斯高帕斯(Scopus)

摘要

In a simple connected graph, the average 2-degree of a vertex is the average degree of its neighbors. With the average 2-degree sequence and the maximum degree ratio of adjacent vertices, we present a sharp upper bound of the spectral radius of the adjacency matrix of a graph, which improves a result in [Y. H. Chen, R. Y. Pan and X. D. Zhang, Two sharp upper bounds for the signless Laplacian spectral radius of graphs, Discrete Math. Algorithms Appl.3(2) (2011) 185-191].

原文English
文章編號1450029
期刊Discrete Mathematics, Algorithms and Applications
6
發行號2
DOIs
出版狀態Published - 1 6月 2014

指紋

深入研究「SPECTRAL RADIUS and AVERAGE 2-DEGREE SEQUENCE of A GRAPH」主題。共同形成了獨特的指紋。

引用此