Abstract
The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. Only few results concerning crossing numbers of graphs obtained as join product of two graphs are known. There are collected the exact values of crossing numbers for join of all graphs of at most four vertices with paths and cycles. In the paper, we extend these results. For two special graphs G on five vertices, we give the crossing numbers of the join products G+Dn , G+Pn , and G+Cn , where Dn consists on n isolated vertices, Pn and Cn are the path and cycle on n vertices, respectively.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
