Results 31 to 40 of about 7,400,368 (352)
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
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
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
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2017 We consider questions that arise from the intersection between theareas of approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms.
Parinya Chalermsook +6 more
semanticscholar +1 more source
On Two Open Problems on Double Vertex-Edge Domination in Graphs
Mathematics, 2019 A vertex v of a graph G = ( V , E ) , ve-dominates every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is a double vertex-edge dominating set if every edge of E is ve-dominated by at least two
Fang Miao +5 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
On the parameterized complexity of approximating dominating set [PDF]
Electron. Colloquium Comput. Complex., 2017 We study the parameterized complexity of approximating the k-Dominating Set (domset) problem where an integer k and a graph G on n vertices are given as input, and the goal is to find a dominating set of size at most F(k) · k whenever the graph G has a ...
S. KarthikC. +2 more
semanticscholar +1 more source
Hereditary Equality of Domination and Exponential Domination in Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2021 Let γ(G) and γe(G) denote the domination number and exponential domination number of graph G, respectively. Henning et al., in [Hereditary equality of domination and exponential domination, Discuss. Math. Graph Theory 38 (2018) 275–285] gave a conjecture:
Chen Xue-Gang, Wang Yu-Feng, Wu Xiao-Fei
doaj +1 more source
Perfect Outer-connected Domination in the Join and Corona of Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let 𝐺 be a connected simple graph. A dominating set 𝑆 ⊆ 𝑉(𝐺) is called a perfect dominating set of 𝐺 if each 𝑢 ∈ 𝑉 𝐺 ∖ 𝑆 is dominated by exactly one element of 𝑆.
Enrico Enriquez +3 more
doaj +1 more source