@article {IOPORT.05251560,
    author       = {Hou, Yaoping and Tang, Zheng and Woo, Chingwah},
    title        = {On the spectral radius, $k$-degree and the upper bound of energy in a graph.},
    year         = {2007},
    journal      = {MATCH - Communications in Mathematical and in Computer Chemistry},
    volume       = {57},
    number       = {2},
    issn         = {0340-6253},
    pages        = {341-350},
    publisher    = {University of Kragujevac \& Faculty of Science Kragujevac, Kragujevac},
    abstract     = {Let $G$ be a simple graph and let $V(G)$ be its vertex set. For $v\in V(G)$, $k$-degree $d_k(v)$ of $v$ is the number of walks of length $k$ of $G$ starting at $v$. A lower bound 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.},
    reviewer     = {Mirko Lepovi\'c (Kragujevac)},
    identifier   = {05251560},
}