Results 191 to 200 of about 13,149,896 (206)
On Open Neighborhood Locating-Dominating in Graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2014 A set D of vertices in a graph G = (V (G), E(G)) is an open neighborhood locating-dominating set (OLD-set) for G if for every two vertices u, v of V (G) the sets N(u) ∩ D and N(v) ∩ D are non-empty and different. The open neighborhood locating-dominating
Nader Jafari Rad
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Locating-Dominating Sets: From Graphs to Oriented Graphs
Discrete Mathematics, 2023Aline Parreau +2 more
exaly
Metric-Locating-Dominating Sets of Graphs for Constructing Related Subsets of Vertices
Applied Mathematics and Computation, 2018Mercè Mora Gine +2 more
exaly
Minimizing the Size of an Identifying or Locating-Dominating Code in a Graph Is NP-Hard
Theoretical Computer Science, 2003Antoine Lobstein +2 more
exaly
Locating–Dominating Sets in Twin-Free Graphs
Discrete Applied Mathematics, 2016Michael A. Henning +2 more
exaly
An Optimal Locating-Dominating Set in the Infinite Triangular Grid
Discrete Mathematics, 2006Iiro Honkala
exaly
Locating-Dominating Sets in Hypergraphs
Periodica Mathematica Hungarica, 2016Usman Ali, Muhammad Fazil, Imran Javaid
exaly
Identifying Codes and Locating–Dominating Sets on Paths and Cycles
Discrete Applied Mathematics, 2011Zhengke Miao
exaly
On the Ensemble of Optimal Dominating and Locating-Dominating Codes in a Graph
Information Processing Letters, 2015Antoine Lobstein +2 more
exaly