Please wait a minute...
高校应用数学学报
Applied Mathematics A Journal of Chinese Universities  2014, Vol. 29 Issue (2): 245-252    DOI:
    
Crossing number of join of three 5-vertex graphs with $P_{n}$
SU Zhen-hua1, HUANG Yuan-qiu2
1. Department of Mathematics, Huaihua University, Huaihua 418008, China
2. Department of Mathematics, Hunan Normal University, Changsha 410081, China
Download:   PDF(0KB)
Export: BibTeX | EndNote (RIS)      

Abstract  Using the results of crossing number of complete bipartite graph $cr(K_{5,n}) =Z(5,n)$ by Kleitman D J, the crossing numbers of the join graph of three specific 5-vertex graphs $G_{12},G_{15},G_{18}$ with the paths $P_{n}$ are given. In addition, an update to description of join graph of 5-vertex graphs with the paths is given too, whose crossing numbers are known.

Key words： crossing number      join graph      the paths      drawing     
Received: 26 November 2013      Published: 29 July 2018
CLC:  O157.5  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
SU Zhen-hua
HUANG Yuan-qiu
Cite this article:

SU Zhen-hua, HUANG Yuan-qiu. Crossing number of join of three 5-vertex graphs with $P_{n}$. Applied Mathematics A Journal of Chinese Universities, 2014, 29(2): 245-252.

URL:

http://www.zjujournals.com/amjcua/     OR     http://www.zjujournals.com/amjcua/Y2014/V29/I2/245


五阶图与路$P_{n}$的联图交叉数

利用Kleitman D J给出的完全二部图的交叉数$cr(K_{5,n})=Z(5,n)$的结果, 分别得到了联图$G_{12}\vee P_{n}, G_{15}\vee P_{n}, G_{18}\vee P_{n}$的交叉数. 同时, 给出了目前已知的所有五阶图与路的联图交叉数情况.

关键词： 交叉数,  联图,  路,  画法 
[1] LI Rui-juan, HAN Ting-ting. Arc-disjoint Hamiltonian cycles and paths in positive-round digraphs#br#[J]. Applied Mathematics A Journal of Chinese Universities, 2017, 32(4): 487-492.
[2] WU Bao-feng, PANG Lin-lin, SHEN Fu-qiang. On the least signless Laplacian eigenvalue of graphs[J]. Applied Mathematics A Journal of Chinese Universities, 2016, 31(1): 83-89.
[3] WANG Zhan-qing, WANG Li-gong, MEI Ruo-xing, ZHAI Ruo-nan, DONG Zhan-peng. Two kinds of bicyclic graphs are determined by their Laplacian spectra[J]. Applied Mathematics A Journal of Chinese Universities, 2016, 31(1): 73-82.
[4] HE Chang-xiang, LIU Shi-qiong. The star matching number and (signless) Laplacian eigenvalues[J]. Applied Mathematics A Journal of Chinese Universities, 2015, 30(3): 333-339.
[5] GUO Qiao-ping, CUI Li-nan. Outpaths of all length of an arc in regular multipartite tournaments[J]. Applied Mathematics A Journal of Chinese Universities, 2014, 29(3): 288-294.