A unit disk graph is the intersection graph of a family of unit disks in the Euclidean plane.
Therefore, this definition differs from unit disk graphs, as well as from other intersection models.
Ad hoc networks beyond unit disk graphs. Wireless Networks, 14:715-729, 2008.
The neighborhood of a vertex in unit disk graph, contains at most five independent vertices.
Assume v is a vertex of unit disk graph G which has six independent vertices.
[6]For any unit disk graph G, |mis(G)| [less than or equal to] 3.8|mcds(G)| + 1.2.
Thus it can be modeled as a unit disk graph [11], a geometric graph in which there is an edge between two nodes if and only if their distance is at most one.
In general graph case, and even in unit disk graph, the problem to find a DS/CDS/WCDS with minimum cardinality is NP-hard [11,12].
Corollary 5 The algorithm Solve-GLTC solves the [tau]-bounded generalized list T-coloring problem on a unit disk graph with n vertices in time
Another class of graphs we want to mention are unit disk graphs, i.e.