Results 21 to 30 of about 7,293,468 (349)
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation [PDF]
International/Italian Conference on Algorithms and Complexity, 2021 An upper dominating set is a minimal dominating set in a graph. In the Upper Dominating Set problem, the goal is to find an upper dominating set of maximum size. We study the complexity of parameterized algorithms for Upper Dominating Set, as well as its
L. Dublois, M. Lampis, V. Paschos
semanticscholar +1 more source
Efficient Domination In Fuzzy Graphs and Intuitionistic Fuzzy Graphs in Strong and weak forms [PDF]
E3S Web of Conferences, 2023 This work defines the concepts of strong efficient dominating set and intuitionistic fuzzy graph. We also introduce an intuitionistic fuzzy graph and a strong efficient dominating number of fuzzy graphs.
S Rajeev Gandhi +4 more
doaj +1 more source
On minimum intersections of certain secondary dominating sets in graphs [PDF]
Opuscula Mathematica, 2023 In this paper we consider secondary dominating sets, also named as \((1,k)\)-dominating sets, introduced by Hedetniemi et al. in 2008. In particular, we study intersections of the \((1,1)\)-dominating sets and proper \((1,2)\)-dominating sets.
Anna Kosiorowska +2 more
doaj +1 more source
Reconfiguration of Dominating Sets [PDF]
Journal of Combinatorial Optimization, 2014 12 pages, 4 ...
Amer E. Mouawad +2 more
openaire +4 more sources
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
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
Disjoint dominating and 2-dominating sets in graphs [PDF]
Discrete Optimization, 2020 A graph $G$ is a $D\!D_2$-graph if it has a pair $(D,D_2)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $D_2$ is a 2-dominating set of $G$. We provide several characterizations and hardness results concerning $D\!D_2$-graphs.
Jerzy Topp +2 more
openaire +3 more sources
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
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
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