On the spectral radius, k-degree and the upper bound of energy in a graph

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

36 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)341-350
Journal / PublicationMatch
Volume57
Issue number2
Publication statusPublished - 2007

Abstract

Let G be a simple graph. For v ∈ V(G), k-degree dk(v) of v is the number of walks of length k of G starting at v. In this paper a lower bounds of the spectral radius of G in terms of the k-degree of vertices is presented and the upper bounds of energy of a connected graph is obtained.

Citation Format(s)

On the spectral radius, k-degree and the upper bound of energy in a graph. / Yaoping, Hou; Zhen, Tang; Chingwah, Woo.
In: Match, Vol. 57, No. 2, 2007, p. 341-350.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review