Abstract
We give the crossing number of the join product$W_{4}+D_{n}$, where$W_{4}$is the wheel on five vertices and$D_{n}$consists of$n$isolated vertices. The proof is based on calculating the minimum number of crossings between two different subgraphs from the set of subgraphs which do not cross the edges of the graph$W_{4}$and from the set of subgraphs which cross the edges of$W_{4}$exactly once.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.