Results 31 to 40 of about 7,293,468 (349)
Closed neutrosophic dominating set in neutrosophic graphs [PDF]
Neutrosophic Sets and Systems, 2023 The aim of this article is to concentrate on the notion of closed neutrosophic domination (CND) number 𝛾𝑐𝑙 (𝐺) of a neutrosophic graph (NG) with using effective edge, furthermore we gain a few outcomes on this notion, the relation between 𝛾𝑐𝑙 (𝐺) and ...
Amir Majeed Nabeel Arif
doaj +1 more source
Deterministic Distributed Dominating Set Approximation in the CONGEST Model [PDF]
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2019 We develop deterministic approximation algorithms for the minimum dominating set problem in the CONGEST model with an almost optimal approximation guarantee.
Janosch Deurer, F. Kuhn, Yannic Maus
semanticscholar +1 more source
Dominating Sets and Connected Dominating Sets in Dynamic Graphs [PDF]
, 2019 In this paper we study the dynamic versions of two basic graph problems: Minimum Dominating Set and its variant Minimum Connected Dominating Set. For those two problems, we present algorithms that maintain a solution under edge insertions and edge deletions in time $O( \cdot \text{polylog}~n)$ per update, where $ $ is the maximum vertex degree in the
Hjuler N. +3 more
openaire +7 more sources
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
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
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
Solving the k-dominating set problem on very large-scale networks
Computational Social Networks, 2020 The well-known minimum dominating set problem (MDSP) aims to construct the minimum-size subset of vertices in a graph such that every other vertex has at least one neighbor in the subset.
Minh Hai Nguyen +3 more
semanticscholar +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
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