匹配数为2的图的最小特征值
필배수위2적도적최소특정치
On The Least Eigenvalue of Graphs with Matching Number Two
  • 万方数据
    数学研究 수학연구
    JOURNAL OF MATHEMATICAL STUDY
    2010年 4期 335-341 ,共7页

    洪振木%汪毅%范益政

    홍진목%왕의%범익정

    邻接矩阵%最小特征值%匹配数 鄰接矩陣%最小特徵值%匹配數
    린접구진%최소특정치%필배수
    Adjacency matrix%Least eigenvalue%Matching number
    在所有给定阶数且匹配数为2的连通图中,我们刻画了最小特征值达到极小的图,给出了这类图最小特征值的下界.
    재소유급정계수차필배수위2적련통도중,아문각화료최소특정치체도겁소적도,급출료저류도최소특정치적하계.
    In this paper, we characterize the unique graph whose least eigenvalue attains the minimum among all connected graphs with fixed order and matching number two.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문