Abstract
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products of the cycles Cn on n vertices with all nonempty disconnected spanning subgraphs of the paths P5 and P6 on five and six vertices, respectively. Recently, this problem was solved for the nonempty disconnected spanning subgraphs of the paths on three and four vertices by Klešč.
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 callSimilar Papers
More From: The Art of Discrete and Applied Mathematics
Disclaimer: 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.
