Abstract
Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory. This paper aims to determine the crossing number of the join product G*+Dn, where G* is a connected graph isomorphic to K2,2,2∖{e1,e2} obtained by removing two edges e1,e2 with a common vertex and a second vertex from the different partitions of the complete tripartite graph K2,2,2, and Dn is a discrete graph composed of n isolated vertices. The proofs utilize known exact crossing number values for join products of specific subgraphs Hk of G* with discrete graphs in combination with the separating cycles. Similar approaches can potentially estimate unknown crossing numbers of other six-vertex graphs with a larger number of edges in join products with discrete graphs, paths or cycles.
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.
