欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
把图G的某条边和图日的某条边合并在一起构成的图，记作G＊eH，在刘彦佩提出联树的基础上，通过把关联曲面逐层分段，得到了n个K5（K3,3）的边合并图K5＊eK5＊e…＊eK5（K3,3＊eK3．3＊e…＊eK3．3）的亏格为[n／2]．
英文摘要：
If G and H are graphs, then G ＊ eH is defined to be a graph obtained by identifying some given edge of G with some given edge of H. In this paper, on the basis of joint trees introduced by Yanpei Liu and by dividing the associated surfaces into segments layer by layer, we show that the genus of K5＊eK5＊e…＊eK5 is [n/2], where n is the number of K5 And so is K3.3＊e K3.3＊e…＊eK3.3
同期刊论文项目
同项目期刊论文
期刊信息
位置：