Abstract
AbstractLet K(x1, x2, ⃛, xn) be a graph without loops or multiple edges, the complement of which consists of n disjoint complete graphs of x1, x2, ⃛, xn vertices. In this paper a class of mappings of K(x1, ⃛, xn) onto the Euclidean plane is described. The minimum number of intersection points of edges for these mappings is determined. This number also involves an upper bound for the so‐called crossing number cr(x1, ⃛, xn), being the minimum number of intersection points of edges for all mappings of K(x1, ⃛, xn) onto the Euclidean plane (see (28)). Equality in (28) is conjectured.
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.
