𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Laplacian-energy like of graphs

✍ Scribed by Bao-Xuan Zhu

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
209 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

Assume that Β΅ 1 , Β΅ 2 , . . . , Β΅ n are eigenvalues of the Laplacian matrix of a graph G. The Laplacian-energy like of G, is defined as follows:

In this note, we give upper bounds for LEL(G) in terms of connectivity or chromatic number and characterize the corresponding extremal graphs.

πŸ“œ SIMILAR VOLUMES

Laplacian energy of a graph
Laplacian energy of a graph
✍ Ivan Gutman; Bo Zhou πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 120 KB
The Laplacian spread of unicyclic graphs
The Laplacian spread of unicyclic graphs
✍ Yan-Hong Bao; Ying-Ying Tan; Yi-Zheng Fan πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 477 KB
On the Laplacian spread of graphs
On the Laplacian spread of graphs
✍ Mingqing Zhai; Jinlong Shu; Yuan Hong πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 238 KB

The Laplacian spread s(G) of a graph G is defined to be the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of G. Several upper bounds of Laplacian spread and corresponding extremal graphs are obtained in this paper. Particularly, if G is a conne

On the Laplacian coefficients of acyclic
On the Laplacian coefficients of acyclic graphs
✍ Bojan Mohar πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 121 KB

Let G be a graph of order n and let (G, Ξ») = n k=0 (-1) k c k Ξ» n-k be the characteristic polynomial of its Laplacian matrix. Zhou and Gutman recently proved that among all trees of order n, the kth coefficient c k is largest when the tree is a path, and is smallest for stars. A new proof and a stre