SPECTRAL RADIUS and AVERAGE 2-DEGREE SEQUENCE of A GRAPH

Yu Pei Huang, Chih Wen Weng

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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

Original languageEnglish
Article number1450029
JournalDiscrete Mathematics, Algorithms and Applications
Volume6
Issue number2
DOIs
StatePublished - 1 Jun 2014

Keywords

  • adjacency matrix
  • average 2-degree
  • Graph
  • spectral radius

Fingerprint Dive into the research topics of 'SPECTRAL RADIUS and AVERAGE 2-DEGREE SEQUENCE of A GRAPH'. Together they form a unique fingerprint.

Cite this