Abstract
The main aim of the paper is to give the crossing number of the join product G*+Dn. The connected graph G* of order six is isomorphic to K3,3\e obtained by removing one edge from the complete bipartite graph K3,3, and the discrete graph Dn consists of n isolated vertices. The proofs were carried out with the help of several possible redrawings of the graph G* with respect to its many symmetries.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference38 articles.
1. Crossing number is NP-complete;Garey;SIAM J. Algebraic. Discret. Methods,1983
2. A note of welcome;J. Graph Theory,1977
3. The crossing number of K5,n;Kleitman;J. Comb. Theory,1970
4. A survey of graphs with known or bounded crossing numbers;Clancy;Australas. J. Comb.,2020
5. The crossing numbers of join products of paths with graphs of order four;Discuss. Math. Graph Theory,2011
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献