On the extremal energies of trees with a given maximum degree

By Wenshui Lin, X. Guo, H. H. Li, 郭晓峰. 2005

50 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Minimum energy on trees with k pendent vertices (2006, background): “[22] determined the tree with maximal energy among the trees with order n and maximum degree (3 n − 2) and the tree with minimal energy among the trees with order n and maximum degree (⌈ n+1 3 ⌉ n − 2 ) .”
ON SPECTRAL MOMENTS AND ENERGY OF GRAPHS (2007, background): “Of the numerous papers on graph energy that recently appeared, we quote here only a few [7–29].”
Bounds for the distance energy of a graph (2008, unknown): “For more results on E(G) see [1,2,4,10–13,16,17,19–25,27–35,37].”