【摘要】 Jason等确定了阶数为n的具有完美匹配树的最大的代数连通度以及相应的极图.本文确定了阶数为n的具有完美匹配树的第二大到第五大的代数连通度以及达到这些数值的图(或图类).更多还原

【Abstract】 Jason etc.determined the largest algebraic connectivity among all trees with perfect matching on n vertices together with the corresponding extremal graph.In this paper, we determine the second to the fifth largest algebraic connectivity among all trees with perfect matching on n vertices together with the corresponding graphs whose algebraic connectivity attain these values.更多还原