| 联图$K_5+P_n$的交叉数 |
| |
| 引用本文： | 苏振华.联图$K_5+P_n$的交叉数[J].数学研究及应用,2018,38(4):331-340. |
| |
| 作者姓名： | 苏振华 |
| |
| 作者单位： | 怀化学院数学系, 湖南 怀化 418008 |
| |
| 摘 要： | A join graph denoted by G + H,is illustrated by connecting each vertex of graph G to each vertex of graph H.In this paper,we prove the crossing number of join product of K_5 + P_n is Z(5,n) + 2 n + n/2] + 4 for n ≥ 2.
|
| 收稿时间： | 2017/10/27 0:00:00 |
| 修稿时间： | 2018/5/17 0:00:00 |
The Crossing Numbers of $K_{5}+P_{n}$ |
| |
| Zhenhua SU.The Crossing Numbers of $K_{5}+P_{n}$[J].Journal of Mathematical Research with Applications,2018,38(4):331-340. |
| |
| Authors: | Zhenhua SU |
| |
| Abstract: | A join graph denoted by $G+H$, is illustrated by connecting each vertex of graph $G$ to each vertex of graph $H$. In this paper, we prove the crossing number of join product of $K_{5}+P_{n}$ is $Z(5,n)+2n+\lfloor \frac{n}{2} \rfloor+4$ for $n\geq 2$. |
| |
| Keywords: | crossing number join product complete graph path |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
|
