On the spectral radius, k-degree and the upper bound of energy in a graph
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 341-350 |
| Journal / Publication | Match |
| Volume | 57 |
| Issue number | 2 |
| Publication status | Published - 2007 |
Link(s)
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.
In: Match, Vol. 57, No. 2, 2007, p. 341-350.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
