Results 231 to 240 of about 41,065 (264)

Graphs with Disjoint Total Dominating Sets

2013
In the metadata of the chapter that will be visualized online, please replace the abstract with the following: “A classical result in domination theory is that the vertex set of every graph without isolates can be partitioned into two dominating sets.
Michael A. Henning, Anders Yeo
openaire   +1 more source

Approximation for minimum total dominating set

Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human, 2009
A 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

The complexity of connected dominating sets and total dominating sets with specified induced subgraphs

Information Processing Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schaudt, Oliver, Schrader, Rainer
openaire   +2 more sources

On the Number of Minimum Total Dominating Sets in Trees

Journal of Applied and Industrial Mathematics, 2023
Summary: 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

Approximation algorithms for the total dominating set problem

Journal of Combinatorial Optimization
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Limin Wang, Zhao Zhang, Donglei Du, Yaping Mao, Xiaoyan Zhang   +4 more
openaire   +2 more sources

Linear Separation of Total Dominating Sets in Graphs

2013
A 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 Milanič
openaire   +1 more source

Properties of Total Dominating Sets and General Bounds

2013
In order to obtain results on the total domination number, we need to first establish properties of TD-sets in graphs. In this chapter, we list properties of minimal TD-sets in a graph. Further we present general bounds relating the total domination number to other parameters.
Michael A. Henning, Anders Yeo
openaire   +1 more source

A Characterization of Graphs Whose Vertex Set Can Be Partitioned into a Total Dominating Set and an Independent Dominating Set

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Teresa W. Haynes, Michael A. Henning
openaire   +2 more sources

Total Dominating Sets and Total Domination Polynomials of Square of Cycles

IOSR Journal of Mathematics, 2014
T. Premala, Dr. C. Sekar
openaire   +1 more source

Cancer statistics for the US Hispanic/Latino population, 2021

Ca-A Cancer Journal for Clinicians, 2021
Kimberly D Miller, Paulo S Pinheiro, Priti Bandi   +2 more
exaly