๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Laplacian energy of a graph

โœ Scribed by Ivan Gutman; Bo Zhou

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
120 KB
Volume
414
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Laplacian-energy like of graphs
The Laplacian-energy like of graphs
โœ Bao-Xuan Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 209 KB

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.

On the Laplacian eigenvalues of a graph
On the Laplacian eigenvalues of a graph
โœ Jiong-Sheng Li; Xiao-Dong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 148 KB

In the note, we present an upper bound for the spectral radius of Laplacian matrix of a graph in terms of a "2-degree" of a vertex.

Subgraphs and the Laplacian spectrum of
Subgraphs and the Laplacian spectrum of a graph
โœ Yasuo Teranishi ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB

Let G be a graph and H a subgraph of G. In this paper, a set of pairwise independent subgraphs that are all isomorphic copies of H is called an H-matching. Denoting by ฮฝ(H, G) the cardinality of a maximum H-matching in G, we investigate some relations between ฮฝ(H, G) and the Laplacian spectrum of G.