Abstract
A disk graph is the intersection graph of disks in the plane, and a unit disk graph is the intersection graph of unit radius disks in the plane. We give upper and lower bounds on the number of labeled unit disk and disk graphs on n vertices. We show that the number of unit disk graphs on n vertices is n2n⋅α(n)n and the number of disk graphs on n vertices is n3n⋅β(n)n, where α(n) and β(n) are Θ(1). We conjecture that there exist constants α,β such that the number of unit disk graphs is n2n⋅(α+o(1))n and the number of disk graphs is n3n⋅(β+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 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.
