首页 | 本学科首页   官方微博 | 高级检索  
     检索      

几个六阶图与星S_n的笛卡尔积交叉数
引用本文:李波,张莉茜,黄元秋.几个六阶图与星S_n的笛卡尔积交叉数[J].汕头大学学报(自然科学版),2009,24(4):4-13.
作者姓名:李波  张莉茜  黄元秋
作者单位:1. 湖南省长沙市南雅中学,湖南,长沙,410005
2. 湖南师范大学数学与计算机科学学院,湖南,长沙,410081
基金项目:国家自然科学基金资助项目,教育部"新世纪优秀人才支持计划"资助项目 
摘    要:分别连结六阶图G1的6个顶点与其它n个顶点,得到一类特殊的图Hn.运用组合方法、归纳思想及反证法证明了Hn的交叉数为Z(6,n)+2「n/2」,并在此基础上证明G1与星K1,n的笛卡尔积的交叉数为Z(6,n)+2「n/2」;另外,证明了含子图S5的其它6个六阶图与星K1,n的笛卡尔积的交叉数都为Z(6,n)+4「n/2」.

关 键 词:  画法  交叉数    笛卡尔积

Crossing Number of Products of Several 6-Vertex Graphs with Star
LI Bo,ZHANG Li-xi,HUANG Yuan-qiu.Crossing Number of Products of Several 6-Vertex Graphs with Star[J].Journal of Shantou University(Natural Science Edition),2009,24(4):4-13.
Authors:LI Bo  ZHANG Li-xi  HUANG Yuan-qiu
Institution:LI Bo1,ZHANG Li-xi2,HUANG Yuan-qiu2(1.Yali High School,Changsha 410005,Hunan,China,2.Department of Mathematics,Hunan Normal University,Changsha 410081,China)
Abstract:A special family of graph denotcd by Hn is obtained by combination the 6- vertices of G1 to other n vertices. The combinaton method anti the induction thought as the reducton were utilized. It is proved that the crossing number of H,, is Z(6,n) + n, 2|n/2|, and the crossing number of Cartesian products of G1 and star K1,n is Z(6, n) + 2|n/2|. The (:tossing number of Cartesian products of Gj(j = 2,3,……,7) whit'h contains the subgraph S5 and star K1,n is Z(6, n)+4|n/2|.
Keywords:graph  drawing  crossing number  star  cartesian products  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号