Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices

被引:0
|
作者
Arbind Kumar Lal
Kamal Lochan Patra
Binod Kumar Sahoo
机构
[1] Indian Institute of Technology Kanpur,Department of Mathematics and Statistics
[2] National Institute of Science Education and Research,School of Mathematical Sciences
来源
Graphs and Combinatorics | 2011年 / 27卷
关键词
Laplacian matrix; Algebraic connectivity; Characteristic set; Perron component; Pendant vertex; 05C50;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we consider the following problem. Over the class of all simple connected graphs of order n with k pendant vertices (n, k being fixed), which graph maximizes (respectively, minimizes) the algebraic connectivity? We also discuss the algebraic connectivity of unicyclic graphs.
引用
收藏
页码:215 / 229
页数:14
相关论文
共 50 条