Results 1 to 10 of about 723 (80)
Optimal Locating-Total Dominating Sets in Strips of Height 3
Discussiones Mathematicae Graph Theory, 2015 A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V \ C the subsets formed
Junnila Ville
doaj +4 more sources
Discrete Applied Mathematics, 2022 The problems of determining locating-dominating, open locating-dominating or locating total-dominating sets of minimum cardinality in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for general graphs.
Gabriela Argiroffo +3 more
openaire +5 more sources
Some results on the open locating-total domination number in graphs [PDF]
Journal of Mahani Mathematical Research, 2023 In this paper, we generalize the concept of an open locating-dominating set in graphs. We introduce a concept as an open locating-total dominating set in graphs that is equivalent to the open neighborhood locating-dominating set.
Fateme Movahedi, Mohammad Hadi Akhbari
doaj +1 more source
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture [PDF]
The Electronic Journal of Combinatorics, 2016 A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. A locating-total dominating set of $G$ is a total dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v ...
Foucaud, Florent, Henning, Michael A.
openaire +6 more sources
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs [PDF]
, 2020 The problems of determining open locating-dominating or locating total-dominating sets of minimum cardinality in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for general graphs. A typical line of attack is therefore to determine the cardinality of minimum such sets in special graphs.
Argiroffo, Gabriela +3 more
openaire +2 more sources
Bounds on the Locating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2020 Given a graph G = (V, E) with no isolated vertex, a subset S of V is called a total dominating set of G if every vertex in V has a neighbor in S. A total dominating set S is called a locating-total dominating set if for each pair of distinct vertices u ...
Wang Kun, Ning Wenjie, Lu Mei
doaj +1 more source
A Note on the Locating-Total Domination in Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain a sharp (improved) lower bound on the locating-total domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
Miller Mirka +4 more
doaj +1 more source
Locating total dominating sets in the join, corona and composition of graphs
Applied Mathematical Sciences, 2014 Let G =( V (G),E(G)) be a connected graph. A subset S of V (G) is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The set NG(v) is the set of all vertices of G adjacent to v .A subset S of V (G) is a locating set of G if NG(u)∩SNG(v)∩S for every two distinct vertices u and v in V (G) \ S.
Benjamin N. Omamalin +2 more
openaire +1 more source
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rad Nader Jafari, Rahbani Hadi
doaj +1 more source
Bounding the Locating-Total Domination Number of a Tree in Terms of Its Annihilation Number
Discussiones Mathematicae Graph Theory, 2019 Suppose G = (V,E) is a graph with no isolated vertex. A subset S of V is called a locating-total dominating set of G if every vertex in V is adjacent to a vertex in S, and for every pair of distinct vertices u and v in V −S, we have N(u) ∩ S ≠ N(v) ∩ S ...
Ning Wenjie, Lu Mei, Wang Kun
doaj +1 more source