Algebraic connectivity for subclasses of caterpillars
2010 ◽
Vol 4
(1)
◽
pp. 181-196
◽
A caterpillar is a tree in which the removal of all pendent vertices make it a path. In this paper, we consider two classes of caterpillars. We present an ordering of caterpillars by algebraic connectivity in one of them and find one that maximizes the algebraic connectivity in the other class.
1988 ◽
Vol 62
(03)
◽
pp. 411-419
◽
1967 ◽
Vol 28
◽
pp. 207-244
Keyword(s):
1967 ◽
Vol 28
◽
pp. 177-206
Keyword(s):
1999 ◽
Vol 173
◽
pp. 249-254
Keyword(s):
1976 ◽
Vol 32
◽
pp. 577-588
1971 ◽
Vol 29
◽
pp. 244-245
Keyword(s):