| 交叉数为2且因子图为路的笛卡尔积图 |
| |
| 引用本文： | 王晶,欧阳章东,黄元秋. 交叉数为2且因子图为路的笛卡尔积图[J]. 应用数学学报, 2020, 0(1): 119-128 |
| |
| 作者姓名： | 王晶 欧阳章东 黄元秋 |
| |
| 作者单位： | 长沙学院计算机工程与应用数学学院;湖南第一师范学院数学系;湖南师范大学数学与统计学院 |
| |
| 基金项目： | 湖南省自然科学基金(No.2018JJ2454);湖南省教育厅重点项目(No.18A382)资助项目 |
| |
| 摘 要： | M.Kle??和J.Petrillová刻画了当G1为圈且cr (G1G2)=2时,因子图G1和G2所满足的充要条件.在此基础上,该文进一步刻画了在cr (G1G2)=2的前提下,当G1=P4,或者G1=P3且△(G2)=4时,因子图G2应满足的充要条件.
|
| 关 键 词： | 交叉数 画法 笛卡尔积图 |
The Cartesian Product Graphs with Crossing Number Two When a Factor is a Path |
| |
| WANG Jing,OUYANG Zhangdong,HUANG Yuanqiu. The Cartesian Product Graphs with Crossing Number Two When a Factor is a Path[J]. Acta Mathematicae Applicatae Sinica, 2020, 0(1): 119-128 |
| |
| Authors: | WANG Jing OUYANG Zhangdong HUANG Yuanqiu |
| |
| Affiliation: | (Department of Mathematics and Computer Science,Changsha University,Changsha 410003;Department of Mathem atics,Hunan First Normal University,Changsha 410205;College of Mathematics and Statistics,Hunan Normal University,Changsha 410081) |
| |
| Abstract: | M.Kle?? and J.Petrillová characterized graphs G1 and G2 for which the crossing number of its Cartesian product G1□G2 is two if G1 is a cycle.Based on this result,we study the necessary and sufficient conditions of G2 for which cr(G1□G2)=2 if G1=P4 or if G1=P3 and △(G2)=4. |
| |
| Keywords: | crossing number drawing cartesian product graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
