ALGEBRAIC CONNECTIVITY FOR SUBCLASSES OF CATERPILLARS

作者：Abreu Nair^*; Rojo Oscar; Justel Claudia

来源：Applicable Analysis and Discrete Mathematics, 2010, 4(1): 181-196.

DOI：10.2298/AADM1000004A

• Tree
• Laplacian matrix
• algebraic connectivity
• diameter

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.

• 出版日期2010-4