The Laplacian Spectrum of Unicyclic Graphs

Journal of East China Normal University(Natural Sc ›› 2003, Vol. 2003 ›› Issue (2): 16-21.

• Article • Previous Articles Next Articles

The Laplacian Spectrum of Unicyclic Graphs

XIAO En-li; SHU Jin-long; WEN Ren-kai

Department of Mathematics, East China Normal University, Shanghai 200062,China

Received:2001-08-06 Revised:2002-03-09 Online:2003-04-15 Published:2003-04-15

Abstract

Abstract: Let G be a graph .The Laplacian matrix L（G）=D（G）-A（G）is the difference of the diagonal matrix of vertex degrees and the 0-1 adjacency matrix. Various aspects of the spectrum of this matrix of unicyclic graphs are investigated. Particular attention is given to the algebraic connecticity, the second least eigenvalue of the Laplacian matrix.

Key words: Laplacian matrix, algebraic connecticity, unicyclic graphs, Laplacian matrix, algebraic connecticity

XIAO En-li;SHU Jin-long;WEN Ren-kai. The Laplacian Spectrum of Unicyclic Graphs[J]. Journal of East China Normal University(Natural Sc, 2003, 2003(2): 16-21.

[1]	GU Lei;YUAN Wei-gang;ZHANG Xiao-dong. Algebraic connectivity of trees with the maximum degree [J]. Journal of East China Normal University(Natural Sc, 2011, 2011(3): 29-34.
[2]	WANG Xiao;DUAN Fang. On dissection of unicyclic graphs(English) [J]. Journal of East China Normal University(Natural Sc, 2009, 2009(1): 13-21.
[3]	YIN Shu-hua;;SHU Jin-long;WU Ya-rong;. Large Graft and Algebraic Connectivity of Trees(Chinese) [J]. Journal of East China Normal University(Natural Sc, 2005, 2005(2): 6-15.

The Laplacian Spectrum of Unicyclic Graphs

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 3

Recommended Articles

Metrics

Comments