The minimum Laplacian spread of unicyclic graphs (Q1044538)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5649989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum Laplacian spread of unicyclic graphs |
scientific article; zbMATH DE number 5649989 |
Statements
The minimum Laplacian spread of unicyclic graphs (English)
0 references
18 December 2009
0 references
The Laplacian spread of a graph is defined as the difference between the largest eigenvalue and the second-smallest eigenvalue of the associated Laplacian matrix. In this paper, the minimum Laplacian spread of unicyclic graphs with given order is determined.
0 references
Laplacian spread
0 references
Laplacian matrix
0 references
eigenvalue
0 references
unicyclic graphs
0 references
algebraic connectivity
0 references
0.9355353713035583
0 references
0.889711856842041
0 references
0.8876469731330872
0 references
0.8777248859405518
0 references
