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

$W_m$与$P_n$ 的笛卡儿积图的交叉数
引用本文:王晶,吕胜祥,黄元秋. $W_m$与$P_n$ 的笛卡儿积图的交叉数[J]. 数学研究及应用, 2009, 29(2): 362-366
作者姓名:王晶  吕胜祥  黄元秋
作者单位:长沙大学数学与信息科学学院, 湖南 长沙 410003; 湖南师范大学数学系, 湖南 长沙 410081;北京交通大学数学系, 北京 100044;湖南师范大学数学系, 湖南 长沙 410081
基金项目:国家自然科学基金(No.10771062); 新世纪优秀人才资助计划(No.07-0276).
摘    要:Most results on crossing numbers of graphs focus on some special graphs, such as the Cartesian products of small graphs with path, star and cycle. In this paper, we obtain the crossing number formula of Cartesian products of wheel Wm with path Pn, for arbitrary m ≥ 3 and n≥ 1.

关 键 词:Wm  Pn  笛卡儿积图  交叉数
收稿时间:2006-12-16
修稿时间:2008-01-02

The Crossing Number of the Cartesian Products of $W_m$ with $P_n$
WANG Jing,L"{U} Sheng Xiang and HUANG Yuan Qiu. The Crossing Number of the Cartesian Products of $W_m$ with $P_n$[J]. Journal of Mathematical Research with Applications, 2009, 29(2): 362-366
Authors:WANG Jing,L"  {U} Sheng Xiang  HUANG Yuan Qiu
Affiliation:Department of Mathematics and Information Sciences, Changsha University, Hunan 410003, China; Department of Mathematics, Hunan Normal University, Hunan 410081, China;Department of Mathematics, Beijing Jiaotong University, Beijing 100044, China;Department of Mathematics, Hunan Normal University, Hunan 410081, China
Abstract:Most results on crossing numbers of graphs focus on some special graphs, such as the Cartesian products of small graphs with path, star and cycle. In this paper, we obtain the crossing number formula of Cartesian products of wheel $W_m$ with path $P_n$ for arbitrary $mgeq 3$ and $ngeq 1.$
Keywords:drawing   crossing number   wheel   path   Cartesian product.
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《数学研究及应用》浏览原始摘要信息
点击此处可从《数学研究及应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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