文章基本信息

标题：The Least Algebraic Connectivity of Graphs
本地全文：下载
作者：Guisheng Jiang ; Guidong Yu ; Jinde Cao 等
期刊名称：Discrete Dynamics in Nature and Society
印刷版ISSN：1026-0226
电子版ISSN：1607-887X
出版年度：2015
卷号：2015
DOI：10.1155/2015/756960
出版社：Hindawi Publishing Corporation
摘要：The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian matrix of the graph, which is a parameter to measure how well a graph is connected. In this paper, we present two unique graphs whose algebraic connectivity attain the minimum among all graphs whose complements are trees, but not stars, and among all graphs whose complements are unicyclic graphs, but not stars adding one edge, respectively.