Results 21 to 30 of about 7,194,939 (348)
An independent dominating set in the complement of a minimum dominating set of a tree [PDF]
Applied Mathematics Letters, 2010 AbstractWe prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T, there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.
Michael A. Henning +2 more
openaire +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
Two-goal Local Search and Inference Rules for Minimum Dominating Set
International Joint Conference on Artificial Intelligence, 2020 Minimum dominating set (MinDS) is a canonical NP-hard combinatorial optimization problem with applications. For large and hard instances one must resort to heuristic approaches to obtain good solutions within reasonable time.
Shaowei Cai +4 more
semanticscholar +1 more source
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
DOMINATION AND EDGE DOMINATION IN TREES
Ural Mathematical Journal, 2020 Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V \setminus S\) is adjacent to a vertex in \(S\).
B. Senthilkumar +2 more
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
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
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
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
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