| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4601828 | Linear Algebra and its Applications | 2010 | 8 Pages |
Abstract
For k, dâ©ľ2, a Bethe tree is a rooted tree with k levels which the root vertex has degree d, the vertices from level 2 to k-1 have degree d+1 and the vertices at the level k are pendent vertices. So et al, using a theorem by Ky Fan have obtained both upper and lower bounds for the Laplacian energy of bipartite graphs. We shall employ the above mentioned theorem to obtain new and improved bounds for the Laplacian energy in the case of Bethe trees.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
