The Laplacian Spectral Radius of a Class of Unicyclic Graphs

Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), U consists of the (unique) cycle (say Ck) of length k and a certain number of trees attached to the vertices of Ck having (in total) n-k edges. If there are at most two trees attached to the vertices...

Full description

Bibliographic Details
Main Author: Haixia Zhang
Format: Article
Language:English
Published: Hindawi Limited 2013-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2013/730396
id doaj-fcae123fae904d79a610dad489df1b06
record_format Article
spelling doaj-fcae123fae904d79a610dad489df1b062020-11-24T22:22:23ZengHindawi LimitedJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/730396730396The Laplacian Spectral Radius of a Class of Unicyclic GraphsHaixia Zhang0Department of Mathematics, Taiyuan University of Science and Technology, Taiyuan 030024, ChinaLet C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), U consists of the (unique) cycle (say Ck) of length k and a certain number of trees attached to the vertices of Ck having (in total) n-k edges. If there are at most two trees attached to the vertices of Ck, where k is even, we identify in the class of unicyclic graphs those graphs whose Laplacian spectral radii are minimal.http://dx.doi.org/10.1155/2013/730396
collection DOAJ
language English
format Article
sources DOAJ
author Haixia Zhang
spellingShingle Haixia Zhang
The Laplacian Spectral Radius of a Class of Unicyclic Graphs
Journal of Applied Mathematics
author_facet Haixia Zhang
author_sort Haixia Zhang
title The Laplacian Spectral Radius of a Class of Unicyclic Graphs
title_short The Laplacian Spectral Radius of a Class of Unicyclic Graphs
title_full The Laplacian Spectral Radius of a Class of Unicyclic Graphs
title_fullStr The Laplacian Spectral Radius of a Class of Unicyclic Graphs
title_full_unstemmed The Laplacian Spectral Radius of a Class of Unicyclic Graphs
title_sort laplacian spectral radius of a class of unicyclic graphs
publisher Hindawi Limited
series Journal of Applied Mathematics
issn 1110-757X
1687-0042
publishDate 2013-01-01
description Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), U consists of the (unique) cycle (say Ck) of length k and a certain number of trees attached to the vertices of Ck having (in total) n-k edges. If there are at most two trees attached to the vertices of Ck, where k is even, we identify in the class of unicyclic graphs those graphs whose Laplacian spectral radii are minimal.
url http://dx.doi.org/10.1155/2013/730396
work_keys_str_mv AT haixiazhang thelaplacianspectralradiusofaclassofunicyclicgraphs
AT haixiazhang laplacianspectralradiusofaclassofunicyclicgraphs
_version_ 1725768655841525760