Abstract

Abstract A disk graph is the intersection graph of disks in the plane, and a unit disk graph is the intersection graph of same radius disks in the plane. We give upper and lower bounds on the number of labelled unit disk and disk graphs on n vertices. We show that the number of disk graphs on n vertices is n ( 3 + o ( 1 ) ) n and the number of unit disk graphs on n vertices is n ( 2 + o ( 1 ) ) n .

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.