共 50 条
Minimizing algebraic connectivity over connected graphs with fixed girth
被引:33
|作者:
Fallat, SM
[1
]
Kirkland, S
[1
]
Pati, S
[1
]
机构:
[1] Univ Regina, Dept Math & Stat, Regina, SK S4S 0A2, Canada
基金:
加拿大自然科学与工程研究理事会;
关键词:
Laplacian matrix;
algebraic connectivity;
girth;
unicyclic graph;
Perron value;
characteristic set;
D O I:
10.1016/S0012-365X(01)00355-7
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let G,g denote the class of all connected graphs on n vertices with fixed girth g. We prove that if n greater than or equal to 3g-1, then the graph which uniquely minimizes the algebraic connectivity over G,g is the unicyclic "lollipop" graph C-n,C-g obtained by appending a g cycle to a pendant vertex of a path on n - g vertices. The characteristic set of C-n,C-g is also discussed. Throughout both algebraic and combinatorial techniques are used. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:115 / 142
页数:28
相关论文