期刊文献+

On the Supereulerian Index of a Graph

On the Supereulerian Index of a Graph
下载PDF
导出
摘要 Two methods for determining the supereulerian index of a graph G are given. A sharp upper bound and a sharp lower bound on the supereulerian index by studying the branch bonds of G are got. Two methods for determining the supereulerian index of a graph G are given. A sharp upper bound and a sharp lower bound on the supereulerian index by studying the branch bonds of G are got.
机构地区 School of Science
出处 《Journal of Beijing Institute of Technology》 EI CAS 2005年第4期453-457,共5页 北京理工大学学报(英文版)
基金 Sponsoredby theNationalFundforStudyingAbroad(LXKYJJ200415)
关键词 supereulerian index iterated line graph split block branch-bond supereulerian index iterated line graph split block branch-bond
  • 相关文献

参考文献7

  • 1Catlin P A.Areduction method tofind spanning eulerian subgraphs[].Journal of Graph Theory B.1988
  • 2Lai HJ.On the hamiltonian index[].Discrete Mathematics.1988
  • 3Xiong L,Liu Z.Hamiltonian iterated line graphs[].Discrete Mathematics.2002
  • 4Mckee T A.Recharacterizing eulerian: inti mations of newduality[].Discrete Mathematics.1984
  • 5Xiong L,Liu Z,Yi G.Characterization of then-th su- pereulerianiteratedline graph[].Journal of Jiangxi Nor- mal University.2000
  • 6Bondy J A,Murty U S R.Graph theory with applica- tions[]..1976
  • 7Xiong L.Circuits in graphs and the hamiltonian index[]..2001

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部