图的局部连通性与上可嵌入性

Locally connectivity and up-embeddability of a graph

下载PDF

导出

摘要研究局部连通图中支撑树的变换.给出L.Nebesk定理的一个新证明,并将其推广得到一类新的上可嵌入图. This paper studied the transformation of spanning trees in a locally connected graph and gave a new proof of Nebesk theorem for up-embeddability of a locally connected graph and generalized it to a new class of upper-embeddable graphs.

作者吴甬翔李刚李浩玲任韩

机构地区宁波职业技术学院华东师范大学数学系

出处《华东师范大学学报（自然科学版）》 CAS CSCD 北大核心 2011年第2期22-31,共10页 Journal of East China Normal University(Natural Science)

基金国家自然科学基金(10671073) 上海市自然科学基金(05ZR14046)

关键词最优树上可嵌入基本圈 optimal tree up-embeddable graph fundamental cycle

分类号 O157.5 [理学—基础数学]

引文网络
相关文献

参考文献10

1BONDY J A, MURTY U S R. Graph Theory with Applications[M]. London: MacMillan, 1976.
2MOHAR B, THOMASSEN C. Graphs on Surfaces[M]. [S.I.]: Johns Hopkins University Press, 2001.
3NORDHAUS E A, STEWART B M, WHITE A T. On the maximum genus of a graph[J]. J Combin Ser B, 1971(11): 258-287.
4XOUNG N H. How to determine the maximum genus of a graph[J]. J Combin Theory Ser B, 1979, 26: 217-225.
5LIU Y P. The maximum orientable genus of a graph[J]. Scientia Sinica, Special Issue on Math II, 1979, 41-55.
6NEBESKY L. A New characterization of the maximum genus of Graphs[J]. J Czechoslvak Math, 1981, 106(31): 604-613.
7HUANGYQ. Maximum genus of a graph in term of its embedding properties[J]. Discreate Math, 2003, 262: 171-180.
8NEBESKY L. Every connected, locally connected graph is upper embeddable[J]. J Graph Theory, 1981(3): 197-199.
9黄元秋,刘彦佩.图的生成树,基本圈与Betti亏数[J].数学物理学报（A辑）,2004,24(4):496-500. 被引量：1
10KUNDU S. Bounds on the number of disjoint spanning trees[J]. J Combin Theory Ser B, 1974, 17: 199-203.

二级参考文献11

1Hunglin Fu, Minchu Tsai. The maximum genus of diameter three graphs.Australasian J Combinatorics, 1996, 14: 187-197
2Yuanqiu Huang, Yanpei Liu. Maximum genus and maximum nonseparating indepedent set of a 3-regular graph. Discrete Math, 1997, 176: 149-158
3Yuangqiu Huang, Yanpei Liu. Maximum genus and girth of graphs. Discrete Math, 1999, 194: 253-259
4Bondy J A, Murty U S R. Graph Theory with Applications.London: Macmillan and New York: Elsevier, 1979
5Gross J L, Tucker T W. Topological Graph Theory. New York: Wiley, 1987
6Xoung N H. How to determine the maximum genus of a graph. J Combinatorial Theory Sereis B, 1979, 26: 217-225
7Nebesky L. N-2-locally connected graphs and their upper embeddability. J Czechoslovak Math, 1991, 41: 731-735
8Skoviera M. The decay number and the maximum genus of a graph. Math Slovaca, 1992, 42(4): 391-406
9Stahl S. On the number of maximum genus embeddings of almost all graphs. Euro J Combinatorics, 1992, 13: 119-126
10Chen J, Archdeacon D, Gross J L. Maximum genus and connectivity. Discrete Math, 1996, 149: 11-29

1刘春房,田家财,黄利国.[4,2]-图的圈可扩性[J].科学技术与工程,2010,10(7):1731-1733.
2黄莎莎,王江鲁.连通、P_3-局部连通[5,3]-图的圈可扩性[J].山东科学,2011,24(4):73-77.
3王江鲁.爪与圈可扩性[J].山东师范大学学报（自然科学版）,1996,11(3):13-16.
4吴向群,任韩.范条件图的上可嵌入性[J].泉州师范学院学报,2004,22(2):44-46. 被引量：2
5任俊峰,欧阳章东,黄元秋.与支配集有关的上可嵌入图[J].湖南文理学院学报（自然科学版）,2007,19(4):18-20.
6吕胜祥,刘彦佩.2-边连通3-正则非上可嵌入图的扩充(英文)[J].数学进展,2015,44(1):55-60.
7张启明,黄元秋.点度,围长与图的上可嵌入性[J].湖南工业大学学报,2007,21(6):26-30.
8张启明,黄元秋,欧阳章东.几类新的上可嵌入图[J].系统科学与数学,2008,28(12):1441-1449.
9盛秀艳.一类上可嵌入图[J].常德师范学院学报（自然科学版）,2003,15(1):14-15. 被引量：1
10黄明芳,周俊,欧卓玲,张童硕.局部连通图的群Z_3-连通性[J].数学杂志,2015,35(2):345-351.

华东师范大学学报（自然科学版）

2011年第2期

浏览历史

内容加载中请稍等...

图的局部连通性与上可嵌入性

参考文献10

二级参考文献11

相关作者

相关机构

相关主题

浏览历史