The orientable genus of the join of a cycle and a complete graph

被引：2
作者：
Ma, Dengju [1 ]
Ren, Han [2 ]
机构：
[1] Nantong Univ, Sch Sci, Nantong 226019, Peoples R China
[2] East China Normal Univ, Dept Math, Shanghai 200062, Peoples R China
来源：
ARS MATHEMATICA CONTEMPORANEA | 2019年 / 17卷 / 01期
关键词：
Surface; orientable genus of a graph; join of two graphs; EMBEDDINGS;
D O I：
10.26493/1855-3974.1695.144
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let m and n be two integers. In the paper we show that the orientable genus of the join of a cycle Cm and a complete graph K-n is d inverted right perpendicalar (m-2) (n-2)/4 inverted leftt perpendicalar if n = 4 and m >= 12, or n >= 5 and m >= 6n - 13.
引用
收藏
页码：223 / 253
页数：31
相关论文
共 14 条
[1]  
Bondy J. A., 2008, GRAPH THEORY, DOI [10.1007/978-1-84628-970-5, DOI 10.1007/978-1-84628-970-5]
[2]  
Craft D. L., 1991, THESIS
[3]   On the genus of joins and compositions of graphs [J].
Craft, DL .
DISCRETE MATHEMATICS, 1998, 178 (1-3) :25-50
[4]  
Dirac G.A., 1953, J. London Math. Soc, V28, P476
[5]   The orientable genus of some joins of complete graphs with large edgeless graphs [J].
Ellingham, M. N. ;
Stephens, D. Christopher .
DISCRETE MATHEMATICS, 2009, 309 (05) :1190-1198
[6]  
Gallai T., 1963, PUBL MATH I HUNGAR A, V8, P165
[7]  
Gallai T., 1963, MAGYAR TUD AKAD MAT, V8, P373
[8]   Triangular embeddings of Kn-Km with unboundedly large m [J].
Korzhik, VP .
DISCRETE MATHEMATICS, 1998, 190 (1-3) :149-162
[9]  
Mohar B., 2001, Johns Hopkins Studies in the Mathematical Sciences
[10]  
Ringel G., 1965, Abh. Math. Sem. Univ. Hamburg, V28, P139, DOI [10.1007/BF02993245, DOI 10.1007/BF02993245]
12