SPECTRAL RADIUS and AVERAGE 2-DEGREE SEQUENCE of A GRAPH

Yu Pei Huang; Chih Wen Weng

doi:10.1142/S1793830914500293

SPECTRAL RADIUS and AVERAGE 2-DEGREE SEQUENCE of A GRAPH

Yu Pei Huang, Chih Wen Weng

應用數學系

研究成果: Article › 同行評審

4 引文斯高帕斯（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	https://doi.org/10.1142/S1793830914500293
出版狀態	Published - 1 6月 2014

存取文件

10.1142/S1793830914500293

其它文件與鏈接

Link to publication in Scopus

引用此

@article{4ebf7a49531d4c5ca0c164e939f0154e,

title = "SPECTRAL RADIUS and AVERAGE 2-DEGREE SEQUENCE of A GRAPH",

abstract = "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].",

keywords = "Graph, adjacency matrix, average 2-degree, spectral radius",

author = "Huang, {Yu Pei} and Weng, {Chih Wen}",

note = "Publisher Copyright: {\textcopyright} 2014 World Scientific Publishing Company.",

year = "2014",

month = jun,

day = "1",

doi = "10.1142/S1793830914500293",

language = "English",

volume = "6",

journal = "Discrete Mathematics, Algorithms and Applications",

issn = "1793-8309",

publisher = "World Scientific",

number = "2",

}

TY - JOUR

T1 - SPECTRAL RADIUS and AVERAGE 2-DEGREE SEQUENCE of A GRAPH

AU - Huang, Yu Pei

AU - Weng, Chih Wen

PY - 2014/6/1

Y1 - 2014/6/1

N2 - 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].

AB - 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].

KW - Graph

KW - adjacency matrix

KW - average 2-degree

KW - spectral radius

UR - http://www.scopus.com/inward/record.url?scp=84923265344&partnerID=8YFLogxK

U2 - 10.1142/S1793830914500293

DO - 10.1142/S1793830914500293

M3 - Article

AN - SCOPUS:84923265344

SN - 1793-8309

VL - 6

JO - Discrete Mathematics, Algorithms and Applications

JF - Discrete Mathematics, Algorithms and Applications

IS - 2

M1 - 1450029

ER -

SPECTRAL RADIUS and AVERAGE 2-DEGREE SEQUENCE of A GRAPH

摘要

存取文件

其它文件與鏈接

指紋

引用此