哈密尔顿性,邻域并和部分平方图
, PP. 21-25
Keywords: 哈密尔顿性,邻域并,插点,部分平方图
Abstract:
利用插点方法,研究图的h-性,给出了k-连通图是哈密尔顿的充分条件:设g是k-连通图(k≥2),若对于每个y∈ik+1(g*),在g中,有σb(y)=sumfromi=otok(|n(yi)|>/(b+k)/2(n(y)-1)+μ((b(2k-2b+1))/2-1),则g是哈密尔顿图.
| [1] | ainouchea,kouiderm.hamiltonismandpartiallysquaregraphs[j].graphsandcombinatorics,1999,15(3):257-265.
|
| [2] | liuy,tianf,wuz.sequenceconcerninghamiltonicityofgraphs[j].journalofnanjingnormaluniversity:naturalscienceedition,1995,18(1):19-28.
|
| [3] | 邦迪ja,默蒂usr.图论及其应用[m].吴望名,译.北京:科学出版社,1984.
|
| [4] | bondyja.longestpathsandcyclesingraphsofhighdegree.researchreportcorr80)16[r].waterloo:canadadeptofcombinatoryandoptimization,univofwaterloo,1980.
|
Full-Text
