检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Jian-bing LIU Rong-xia HAO
机构地区:[1]Department of Mathematics, Beijing Jiaotong University
出 处:《Acta Mathematicae Applicatae Sinica》2018年第3期478-484,共7页应用数学学报(英文版)
基 金:Supported by the National Natural Science Foundation of China(No.11731002);the Fundamental Research Funds for the Central Universities(Nos.2016JBM071,2016JBZ012)
摘 要:An embedding of a digraph in an orientable surface is an embedding as the underlying graph and arcs in each region force a directed cycle. The directed genus is the minimum genus of surfaces in which the digraph can be directed embedded. Bonnington, Conder, Morton and McKenna [J. Cornbin. Theory Ser. B,85(2002) 1-20] gave the problem that which tournaments on n vertices have the directed genus [(n-3)(n-4)/12]the genus of Kn. In this paper, we use the current graph method to show that there exists a tournament, whichhas the directed genus[(n-3)(n-4)/12], on n vertices if and only if n = 3 or 7 (mod 12).An embedding of a digraph in an orientable surface is an embedding as the underlying graph and arcs in each region force a directed cycle. The directed genus is the minimum genus of surfaces in which the digraph can be directed embedded. Bonnington, Conder, Morton and McKenna [J. Cornbin. Theory Ser. B,85(2002) 1-20] gave the problem that which tournaments on n vertices have the directed genus [(n-3)(n-4)/12]the genus of Kn. In this paper, we use the current graph method to show that there exists a tournament, whichhas the directed genus[(n-3)(n-4)/12], on n vertices if and only if n = 3 or 7 (mod 12).
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249