Geodesic
The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
Discussiones Mathematicae. Graph Theory, Tome 38 (2018) no. 4, pp. 899-909.

Voir la notice de l'article provenant de la source Library of Science

There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Keywords: disconnected graph, crossing number, join product 
@article{DMGT_2018_38_4_a2,
     author = {Ding, Zongpeng and Huang, Yuanqiu},
     title = {The {Crossing} {Numbers} of {Join} of {Some} {Graphs} with n {Isolated} {Vertices}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {899--909},
     publisher = {mathdoc},
     volume = {38},
     number = {4},
     year = {2018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2018_38_4_a2/}
}
TY  - JOUR
AU  - Ding, Zongpeng
AU  - Huang, Yuanqiu
TI  - The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2018
SP  - 899
EP  - 909
VL  - 38
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2018_38_4_a2/
LA  - en
ID  - DMGT_2018_38_4_a2
ER  - 
%0 Journal Article
%A Ding, Zongpeng
%A Huang, Yuanqiu
%T The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
%J Discussiones Mathematicae. Graph Theory
%D 2018
%P 899-909
%V 38
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2018_38_4_a2/
%G en
%F DMGT_2018_38_4_a2
Ding, Zongpeng; Huang, Yuanqiu. The Crossing Numbers of Join of Some Graphs with n Isolated Vertices. Discussiones Mathematicae. Graph Theory, Tome 38 (2018) no. 4, pp. 899-909. http://geodesic.mathdoc.fr/item/DMGT_2018_38_4_a2/

[1] K. Asano, The crossing number of K1,3,n and K2,3,n, J. Graph Theory 10 (1986) 1–8. doi:10.1002/jgt.3190100102

[2] J.A. Bondy, U.S.R. Murty, Graph Theory with Applications (North-Holland, New York-Amsterdam-Oxford, 1982).

[3] P. Erdős and R.K. Guy, Crossing number problems, Amer. Math. Monthly 80 (1973) 52–58. doi:10.2307/2319261

[4] P.T. Ho, On the crossing number of K1,m,n, Discrete Math. 308 (2008) 5996–6002. doi:10.1016/j.disc.2007.11.023

[5] Y. Huang and T. Zhao, The crossing number of K1,4,n, Discrete Math. 308 (2008) 1634–1638. doi:10.1016/j.disc.2006.12.002

[6] D.J. Kleitman, The crossing number of K5,n, J. Combin. Theory 9 (1970) 315–323. doi:10.1016/S0021-9800(70)80087-4

[7] M. Klešč, The join of graphs and crossing numbers, Electron. Notes Discrete Math. 28 (2007) 349–355. doi:10.1016/j.endm.2007.01.049

[8] K. Zarankiewicz, On a problem of P. Turán concerning graphs, Fund. Math. 41 (1955) 137–145. doi:10.4064/fm-41-1-137-145