具有完美匹配树的代数连通度的排序
구유완미필배수적대수련통도적배서
The Ordering of Trees With Perfect Matching by the Algebraic Connectivity
  • 万方数据
    数学进展 수학진전
    ADVANCES IN MATHEMATICS
    2008年 3期 269-282 ,共14页

    刘颖%邵嘉裕%袁西英

    류영%소가유%원서영

    树%完美匹配%代数连通度%瓶颈矩阵 樹%完美匹配%代數連通度%瓶頸矩陣
    수%완미필배%대수련통도%병경구진
    tree%perfect matching%algebraic connectivity%bottleneck matrix
    Jason等确定了阶数为n的具有完美匹配树的最大的代数连通度以及相应的极图.本文确定了阶数为n的具有完美匹配树的第二大到第五大的代数连通度以及达到这些数值的图(或图类).
    Jason등학정료계수위n적구유완미필배수적최대적대수련통도이급상응적겁도.본문학정료계수위n적구유완미필배수적제이대도제오대적대수련통도이급체도저사수치적도(혹도류).
    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.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문