竞赛图中Hamilton路数的一个下界
경새도중Hamilton로수적일개하계
A Lower Bound of the Number of Hamilton Path for Tournament
  • 万方数据
    华北工学院学报 화북공학원학보
    JOURNAL OF NORTH CHINA INSTITUTE OF TECHNOLOGY
    2004年 6期 438-440 ,共3页

    罗永萍%杨爱民

    라영평%양애민

    竞赛图%强连通分支%Hamilton路 競賽圖%彊連通分支%Hamilton路
    경새도%강련통분지%Hamilton로
    tournament%strong component%Hamilton path
    假设T是一个竞赛图,T1,T2,…,T,(s≥1)是T的所有强连通分支.本文通过考虑每个Ti的入度序列给出了T中Hamilton路数的一个下界.
    가설T시일개경새도,T1,T2,…,T,(s≥1)시T적소유강련통분지.본문통과고필매개Ti적입도서렬급출료T중Hamilton로수적일개하계.
    Let T be a tournament, and T1 ,T2,… ,Ts(s≥1) be the strong components of T. Though considering the in-degree sequence of Ti, for every i ∈ { 1,2,…,s}, this paper gives a lower bound of the number of Hamilton path for tournament T.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문