Results of the maximum genus of graphs

Results of the maximum genus of graphs

导出

摘要 In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of (S)koviera. In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera.

作者 Guang-hua DONG Yan-pei LIU

机构地区 Department of Mathematics

出处《Science China Mathematics》 SCIE 2007年第11期1563-1570,共8页 中国科学：数学（英文版）

基金 This work is partially supported by the National Natural Science Foundation of China (Grant No.10571013)

关键词 MAXIMUM GENUS up-embeddable DIAMETER maximum genus up-embeddable diameter

分类号 N [自然科学总论]

引文网络
相关文献

参考文献18

1[1]Nordhause E A,Stewart B M,White A T.On the maximum genus of a graph.J Combin Theory,11:151-185 (1971)
2[2]Liu Y P.The maximum orientable genus of a graph.Scientia Sinica (Special Issue),(Ⅱ):41-55 (1979)
3[3]Nebesk(y) L.A new characterization of the maximum genus of a graph.Czechoslova Math J,31(106):604-613 (1981)
4[4]Huang Y Q,Liu Y P.Face size and the maximum genus of a graph.J Combin Theory Ser B,80:356-370(2000)
5[5](S)koviera M,Nedela R.The maximum genus of a graph and doubly Eulerian trails.JUM Bolletion (Ser B),4:541-551 (1990)
6[6]Jaeger F,Payan C,Xuong N H.A classes of upper embeddable graphs.J Graph Theory,3:387-391 (1979)
7[7]Kundu S.Bounds on number of disjoint spanning trees.J Combin Theory Ser B,17:199-203 (1974)
8[8]Jungerment M.A characterization of upper embeddable graphs.Trans Math Soc,241:401-406 (1979)
9[9](S)koviera M.The maximum genus of graphs diameter two.J Combin Theory Ser B,17:199-203 (1974)
10[10]He W L,Liu Y P.A note on the maximum genus of graph G3.J Syst Sci arid Infor,1(4):615-619 (2003)

1Cai JunLiang,Dong GuangHua,Liu YanPei.A sufficient condition on upper embeddability of graphs[J].Science China Mathematics,2010,53(5):340-347.
2周永生,李唐芬.LOWER BOUND OF CONNECTIVITY IN CIRCULAR GRAPHS[J].Chinese Science Bulletin,1991,36(18):1579-1579.
3CHENG Kan,HE Zongfu Institute of Applied of Mathematics,Academia Sinica,Beijing 100080,China Air Force Engineering College,Xi’an 710038, China.RELIABILITY BOUNDS IN NWUE CLASS WITH KNOWN MEAN AND VARIANCE[J].Systems Science and Mathematical Sciences,1993,6(2):145-149.
4CHEN Xiebin.A new method for constructing infinite families of k-tight optimal double loop networks[J].Science China Mathematics,2006,49(4):525-532. 被引量：3
5赵春来.An Algorithm for the Rank of Elliptic Curves[J].Chinese Science Bulletin,1993,38(16):1329-1331.
6严志敏,龚升.Bloch Constant of Holomorphic Mappings on Bounded Symmetric Domains[J].Science China Mathematics,1993,36(3):285-299. 被引量：9
7WANG Yingqian LI Qiao.Upper bound of the third edge-connectivity of graphs[J].Science China Mathematics,2005,48(3):360-371. 被引量：12
8董荣森.A KIND OF IMPORTANT LATTICE[J].Chinese Science Bulletin,1991,36(22):1929-1929.
9程旭,周德堂.ESTIMATION OF THE FIRST FJGENVALUE ON COMPACT RIEMANN MANIFOLD WITH NEGATIVE RICCI CURVATURE[J].Chinese Science Bulletin,1991,36(7):611-612.
10LU RuiJing & LIANG EnWei Physical Science & Technology College, Guangxi University, Nanning 530004, China.Luminosity-peak energy relation in the decay phases of gamma-ray burst pulses[J].Science China(Physics,Mechanics & Astronomy),2010,53(1):163-170. 被引量：1

Science China Mathematics

2007年第11期

浏览历史

内容加载中请稍等...

Results of the maximum genus of graphs

参考文献18

相关作者

相关机构

相关主题

浏览历史