Vertices belonging to all or to no minimum locating dominating sets of trees
نویسندگان
چکیده
منابع مشابه
Vertices Belonging to All or to No Minimum Locating Dominating Sets of Trees
A set D of vertices in a graph G is a locating-dominating set if for every two vertices u, v of G \ D the sets N(u) ∩ D and N(v) ∩ D are non-empty and different. In this paper, we characterize vertices that are in all or in no minimum locating dominating sets in trees. The characterization guarantees that the γL-excellent tree can be recognized in a polynomial time.
متن کاملVertices belonging to all or to no minimum double dominating sets in trees
In a graph G = (V, E) , a vertex dominates itself and all its neighbors. A double dominating set of G is a dominating set that dominates every vertex of G at least twice. In this paper, we characterize vertices that are in all or in no minimum double dominating sets in trees.
متن کاملVertices contained in all or in no minimum k - dominating sets of a tree ∗
Let k be a positive integer and G = (V,E) be a simple graph. A subset S ⊆ V is dominating in G, if for each vertex v ∈ V \ S, N(v) ∩ S 6= ∅. In 1985, Fink and Jacobson gave a generalization of the concept of dominating sets in graphs. A subset S of V is kdominating in G, if every vertex of V \ S is adjacent to at least k vertices in S. In this paper, we characterize vertices that are in all or ...
متن کاملVertices in all minimum paired-dominating sets of block graphs
Let G = (V,E) be a simple graph without isolated vertices. A set S ⊆ V is a paired-dominating set if every vertex in V − S has at least one neighbor in S and the subgraph induced by S contains a perfect matching. In this paper, we present a linear-time algorithm to determine whether a given vertex in a block graph is contained in all its minimum paired-dominating sets.
متن کاملVertices Belonging to All Critical Independent Sets of a Graph
Let G = (V,E) be a graph. A set S ⊆ V is independent if no two vertices from S are adjacent, and by Ind(G) (Ω(G)) we mean the set of all (maximum) independent sets of G, while core(G) = ∩{S : S ∈ Ω(G)}, [13]. The neighborhood of A ⊆ V is N(A) = {v ∈ V : N(v)∩A 6= ∅}. The independence number α(G) is the cardinality of each S ∈ Ω(G), and μ(G) is the size of a maximum matching of G. The number idc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2009
ISSN: 1232-9274
DOI: 10.7494/opmath.2009.29.1.5