[1]高岩波,任韩.独立数≤5的3-边连通简单图的上可嵌入性(英文)[J].南京师大学报(自然科学版),2006,29(01):17-20.
　Gao Yanbo~,Ren Han~.Upper Embeddability of 3-Edge-Connected Simple Graphs with Independence-Number≤5[J].Journal of Nanjing Normal University(Natural Science Edition),2006,29(01):17-20.
点击复制

独立数≤5的3-边连通简单图的上可嵌入性(英文)()
分享到：

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

卷:
第29卷
期数:
2006年01期
页码:
17-20
栏目:
数学
出版日期:
2006-03-30

文章信息/Info

Title:
Upper Embeddability of 3-Edge-Connected Simple Graphs with Independence-Number≤5
作者:
高岩波;任韩;
( 1. 南通大学理学院, 江苏南通226007)
( 2. 华东师范大学数学系, 上海200062 )
Author(s):
Gao Yanbo~1; Ren Han~2
( 1. School of Science, N antong U nivers ity, N antong 226007, Ch ina)
( 2. Departm en t ofMathem atics, East Ch ina Norm alUn ivers ity, Shangh ai200062, Ch ina)
关键词:
图;  最大亏格;  Betti亏数;  上可嵌入的;  独立数
Keywords:
graph;  m axim um genus;  b ett i deficien cy;  upper em beddab le;  independen ce-number
分类号:
O157.5
摘要:
结合边连通度,本文探讨了3-边连通简单图的独立数与上可嵌入性的关系,我们得到了下列结果:设G是一个3-边连通简单图,α(G)是G的独立数,若α(G)≤5,则G是上可嵌入的,同时我们又得到了两个在3-边连通意义下最小的非上可嵌入图例.
Abstract:
Com b ined w ith th e edge-connect ivity, th is paper investigates the relationsh ip b etw een the independence- numb er and the upper-emb eddab ility of a 3-edge-conn ected sim p le graph and obtain s the follow ing resu lt: LetG be a 3- edge-connected sim p le graph w ith α(G )≤ 5 (w here α(G ) is the indep endence-numb er ofG ) , th enG is upper embed- dab le, and two m in im al examp les are given in th e sen se that th ere are 3-edge-connected graphsw h ich are n ot upper em- beddab le.

参考文献/References:

[ 1] Bondy J A, Murty U S R. G raph Theory w ith Applications[M ]. N ew York: E lsev ier Science, 1976.
[ 2] Stahl S. The embedd ing s of a graph a survey[ J]. J Graph Theory, 1978, 2: 275-298.
[ 3] No rdhaus E, S tew art B, W hite A T. On the max im um g enus of a g raph[ J]. Journal Comb inator ia l Theory Ser ies B, 1971, 11: 258-267.
[ 4] Xuong N H. H ow to dete rm ine the m ax im um g enus o f agraph[ J]. Journa l o f Comb inator ial Theory Series B, 1979, 26:217-225.
[ 5] Kundu S. Bounds on number of d isjo int spanning trees[ J]. Journa l Com binato rial Theory Se ries B, 1974, 17: 199-203.
[ 6] Junge rman M. A character ization of upper-embeddab le g raphs[ J] . Transactions o f the Am er ican M athema tica l Society,1978, 241: 401-406.
[ 7] Xuong N H. U pper-embeddab le g raphs and re lated top ics[ J]. Jou rnal o f Comb inator ia l Theory Se ries B, 1979, 26: 226-232.
[ 8] Nebesky L. A new character izations o f the m ax imum genus of graphs[ J]. Czechoslovak M ath J, 1981, 31( 106 ): 604-613.
[ 9] H uang Y Q, L iu Y P. An improvem ent of a theorem on the m ax im um genus for g raphs[ J]. M athem aticaApplicate, 1998, 11( 2): 109-112.
[ 10] H uang Y P, Liu Y P. The m ax imum genus of graphs with diam e ter three[ J]. Discrete Mathematics, 1999, 194( 1 /3):139-149.

相似文献/References:

[1]徐爱庆.关于三类六点七边图的图设计[J].南京师大学报(自然科学版),2003,26(01):23.
　Xu Aiqing.The Designs of Three Kinds of Graphs with Six Points and Seven Edges[J].Journal of Nanjing Normal University(Natural Science Edition),2003,26(01):23.
[2]李海燕,郭 锦.k-正则可图序列的公平划分问题[J].南京师大学报(自然科学版),2018,41(02):1.[doi:10.3969/j.issn.1001-4616.2018.02.001]
　Li Haiyan,Guo Jin.k-Regular Graphic Degree Sequence Variant of JudiciousBalanced Bipartition Problem of Graphs[J].Journal of Nanjing Normal University(Natural Science Edition),2018,41(01):1.[doi:10.3969/j.issn.1001-4616.2018.02.001]

备注/Memo

备注/Memo:
Foundation item: Supported by the Nat ional N aturalS cience Foundat ion of China ( 10271048) and ShanghaiPriority Academic Disciplin e and Science and Technology Comm ission of Shanghai Mun icipality ( 04 JC14031 ) .
Biography: Gao Yanbo, born in 1962, associate professor, majored in graph theory. E-mail:gao. yb@ ntu. edu. cn
更新日期/Last Update: 2013-05-05