Covering graphs with convex sets and partitioning graphs into convex sets
نویسندگان
چکیده
منابع مشابه
Partitioning a graph into convex sets
Let G be a finite simple graph. Let S ⊆ V (G), its closed interval I[S] is the set of all vertices lying on a shortest path between any pair of vertices of S. The set S is convex if I[S] = S. In this work we define the concept of convex partition of graphs. If there exists a partition of V (G) into p convex sets we say that G is p-convex. We prove that is NP -complete to decide whether a graph ...
متن کاملConvex Sets in Lexicographic Products of Graphs
Geodesic convex sets, Steiner convex sets, and J-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies [4, Theorem 3.1].
متن کاملGeometric graphs on convex point sets
In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric graphs like unit distance graphs on convex point sets. In the framework of convex point sets, we also focus on a generalized version of Gabriel graphs known as locally Gabriel graphs or LGGs. LGGs can also be seen as th...
متن کاملCovering point sets with two convex objects
Let P2n be a point set in the plane with n red and n blue points. Let CR and CB (SR and SB) respectively be red and blue colored and disjoint disks (axisparallel squares). In this paper we prove the following results. Finding the positions for CR and CB that maximizes the number of red points covered by CR plus the number of blue points covered by CB can be done in O(n log n) time. Finding two ...
متن کاملPartitioning Graphs into Generalized Dominating Sets
We study the computational complexity of partitioning the vertices of a graph into generalized dominating sets. Generalized dominating sets are parameterized by two sets of nonnegative integers and which constrain the neighborhood N (v) of vertices. A set S of vertices of a graph is said to be a (;)-set if 8v 2 S : jN(v) \ Sj 2 and 8v 6 2 S : jN(v) \ Sj 2 .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2020
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2020.105944