Results 11 to 20 of about 53,392 (268)
On redundant locating-dominating sets
Discrete Applied Mathematics, 2023 A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and can distinguish its own location from its neighbors. We explore a fault-tolerant variant of locating-dominating sets called redundant locating-dominating sets, which can ...
Devin C. Jean, Suk Jai Seo
openaire +3 more sources
On Hop Roman Domination in Trees [PDF]
Communications in Combinatorics and Optimization, 2019 Let $G=(V,E)$ be a graph. A subset $S\subset V$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $G$.
N. Jafari Rad, A. Poureidi
doaj +1 more source
New Results on Directed Edge Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$ from $v$, or at ...
Rémy Belmonte +4 more
doaj +1 more source
Neutrosophic special dominating set in neutrosophic graphs [PDF]
Neutrosophic Sets and Systems, 2021 The neutrosophic graph is a new version of graph theory that has recently been proposed as an extension of fuzzy graph and intuitionistic fuzzy graph that provides more precision compatibility and flexibility than a fuzzy graph and an intuitionistic ...
Sadegh Banitalebi, Rajab Ali Borzooei
doaj +1 more source
Connected End Anti-Fuzzy Equitable Dominating Set In Anti-Fuzzy Graphs
Ratio Mathematica, 2023 In this paper, the notion of connected end anti-fuzzy equitable dominating set of an anti-fuzzy graph is discussed. The connected end anti-fuzzy equitable domination number for some standard graphs are obtained.
Janofer K, S.Firthous Fatima
doaj +1 more source
Disjoint Secure Domination in the Join of Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let G = (V(G),E(G)) be a simple connected graph. A dominating set S in G is called a secure dominating set in G if for every u ∈ V (G) \ S, there exists v ∈ S ∩ NG(u) such that (S \ {v}) ∪ {u} is a dominating set.
Jonecis Dayap, Enrico Enriquez
doaj +1 more source
Domination in m− polar soft fuzzy graphs
Ratio Mathematica, 2023 In this paper, we have introduced dominating set, minimal dominating set, independent dominating set, maximal independent dominating set in m − polar soft fuzzy graphs.
S Ramkumar, R Sridevi
doaj +1 more source
Online Dominating Set and Independent Set
CoRR, 2021 Finding minimum dominating set and maximum independent set for graphs in the classical online setup are notorious due to their disastrous $Ω(n)$ lower bound of the competitive ratio that even holds for interval graphs, where $n$ is the number of vertices.
Minati De +2 more
openaire +2 more sources
Inverse Clique Domination in Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let G be a connected simple graph. A nonempty subset S of the vertex set V (G) is a clique in G if the graph induced by S is complete. A clique S in G is a clique dominating set if it is a dominating set.
Carmelita Loquias +2 more
doaj +1 more source
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Mathematics, 2022 Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source