Müller, Tobias (2011), "Sphere and dot product representations of graphs", Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry (SoCG'11), June 13–15, 2011, Paris, France, pp. Sen, Arunabha (1995), "Broadcast scheduling algorithms for radio networks", Military Communications Conference, IEEE MILCOM '95, vol. An example of a graph that is not a unit disk graph is the star K 1, 6 -free graphs", Discrete Applied Mathematics, 284: 53–60, doi: 10.1016/j.dam.2020.03.024, MR 4115456 Unit disk graphs may be formed in a different way from a collection of equal-radius circles, by connecting two circles with an edge whenever one circle contains the center of the other circle.Įvery induced subgraph of a unit disk graph is also a unit disk graph.These graphs have a vertex for each circle or disk, and an edge connecting each pair of circles or disks that have a nonempty intersection. Unit disk graphs are the intersection graphs of equal-radius circles, or of equal-radius disks.Unit disk graphs are the graph formed from a collection of points in the Euclidean plane, with a vertex for each point and an edge connecting each pair of points whose distance is below a fixed threshold.There are several possible definitions of the unit disk graph, equivalent to each other up to a choice of scale factor: They are commonly formed from a Poisson point process, making them a simple example of a random structure. That is, it is a graph with one vertex for each disk in the family, and with an edge between two vertices whenever the corresponding vertices lie within a unit distance of each other. In geometric graph theory, a unit disk graph is the intersection graph of a family of unit disks in the Euclidean plane. Intersection graph of unit disks in the plane A collection of unit circles and the corresponding unit disk graph.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |