Abstract

We give upper bounds for the edge integrity and the vertex integrity of k-type nearest neighbor graphs in Rd. For n the order of a graph, examples are constructed to show that the bounds are best possible in the parameters n and k. The results follow from decompositions that are shown for certain graphs that possess small edge or vertex separators. A vertex separator theorem for nearest neighbor graphs is known, and an edge separator theorem is shown. We also apply the decompositions to obtain upper bounds for the edge integrity of planar graphs, graphs of fixed genus, and trees.

Full Text
Paper version not known

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 call

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.