Abstract
Most results on the crossing number of a graph focus on the special graphs, such as Cartesian products of small graphs with paths Pn, cycles Cn or stars Sn. In this paper, we extend the results to Cartesian products of complete bipartite graphs K2,m with paths Pn for arbitrary m ≥ 2 and n ≥ 1.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
