| 具有完美匹配树的代数连通度的排序 |
| |
| 引用本文： | 刘颖,邵嘉裕,袁西英.具有完美匹配树的代数连通度的排序[J].数学进展,2008,37(3). |
| |
| 作者姓名： | 刘颖 邵嘉裕 袁西英 |
| |
| 作者单位： | 同济大学数学系,上海,200092 |
| |
| 摘 要： | Jason等确定了阶数为n的具有完美匹配树的最大的代数连通度以及相应的极图．本文确定了阶数为n的具有完美匹配树的第二大到第五大的代数连通度以及达到这些数值的图（或图类）．
|
| 关 键 词： | 树 完美匹配 代数连通度 瓶颈矩阵 |
The Ordering of Trees With Perfect Matching by the Algebraic Connectivity |
| |
| LIU Ying,SHAO Jiayu,YUAN Xiying.The Ordering of Trees With Perfect Matching by the Algebraic Connectivity[J].Advances in Mathematics,2008,37(3). |
| |
| Authors: | LIU Ying SHAO Jiayu YUAN Xiying |
| |
| 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. |
| |
| Keywords: | tree perfect matching algebraic connectivity bottleneck matrix |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
