Results 201 to 210 of about 11,901,808 (241)
Some of the next articles are maybe not open access.
Graphs with few total dominating sets
Discrete Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcin Krzywkowski, Stephan G. Wagner
openaire +1 more source
2005
In this paper, we consider cooperative games arising from total domination problem on graphs. We introduce two games, rigid total dominating set game and relaxed total dominating set game, and focus on their cores. First, a common necessary and sufficient condition for the balancedness of the two total dominating set games is obtained.
Qizhi Fang, Hye Kyung Kim, Dae Sik Lee
openaire +2 more sources
In this paper, we consider cooperative games arising from total domination problem on graphs. We introduce two games, rigid total dominating set game and relaxed total dominating set game, and focus on their cores. First, a common necessary and sufficient condition for the balancedness of the two total dominating set games is obtained.
Qizhi Fang, Hye Kyung Kim, Dae Sik Lee
openaire +2 more sources
On the Number of Minimum Total Dominating Sets in Trees
Journal of Applied and Industrial Mathematics, 2023Summary: The minimum total dominating set (MTDS) of a graph is a vertex subset \(D\) of minimum cardinality such that every vertex of the graph is adjacent to at least one vertex of \(D\). In this paper we obtain the sharp upper bound for the number of MTDS in the class of \(n\)-vertex 2-caterpillars.
openaire +2 more sources
Information Processing Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oliver Schaudt, Rainer Schrader
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oliver Schaudt, Rainer Schrader
openaire +2 more sources
Approximation for minimum total dominating set
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human, 2009A total dominating set is a dominating set which induces a subgraph without isolated vertices. In this paper, we study the approximation of minimum total dominating set problem. First, we present a new analysis for one-step greedy algorithm with approximation ratio ln(δ-0.5)+1.5, where δ is the maximum degree of the given graph.
openaire +1 more source
A Distributed Approximation Algorithm for the Total Dominating Set Problem
2022Given a network graph $G=(V,E)$, a subset $T\subseteq V$ is said to be a total dominating set (TDS) if every $v\in V$ is adjacent to at least one node in $T$. In this paper, we present a distributed algorithm for the TDS problem via the LP relaxation techniques.
Limin Wang +4 more
openaire +2 more sources
Linear Separation of Total Dominating Sets in Graphs
2013A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices so that a set of vertices is a total dominating set if and only if the sum of the corresponding weights exceeds a certain threshold. We show
Nina Chiarelli, Martin Milanic
openaire +3 more sources
Algorithmic results in secure total dominating sets on graphs
Theoretical Computer Science, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Connected Total Dominating Sets and Connected Total Domination Polynomials of Square of Paths
International Journal of Mathematics Trends and Technology, 2014Let G be a simple connected graph of order n. Let Dct(G, i) be the family of connected total dominating sets in G with cardinality i. The polynomial Dct (G, x) = n i (G) ct dct (G, i) x is called the connected total domination polynomial of G. In this paper, we obtain a recursive formula for dct ( 2 n P , i).
A Vijayan, T. Anitha Baby
openaire +1 more source
Approximation algorithms for the total dominating set problem
Journal of Combinatorial OptimizationzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Limin Wang +4 more
openaire +2 more sources