Results 261 to 270 of about 43,554 (293)

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 Milanic
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

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

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

Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set [PDF]

Australas. J Comb.
The theme of this paper is around the class of graphs whose vertex set can be partitioned into two sets one of which is an independent set whereas the other is a total dominating set, that is, a dominating set that has no isolated vertices. Such a graph is abbreviated as a TI graph.
Teresa W. Haynes, Michael A. Henning
openaire   +1 more source

A Rough-Set Based Solution of the Total Domination Problem

2017
This paper aims to provide a rough set-based reduction solution for a type of domination problem in graph theory. First, we introduce a decision table to represent the vertices and edges of a graph. Second, we claim that computing a minimal total dominating set of a graph is equivalent to finding a reduct of the induced decision table.
Anhui Tan, Yuzhi Tao, Chao Wang
openaire   +1 more source

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

A Distributed Approximation Algorithm for the Total Dominating Set Problem

SSRN Electronic Journal, 2022
Limin Wang, Zhao Zhang 0002, Donglei Du, Yaping Mao, Xiaoyan Zhang 0001   +4 more
openaire   +1 more source

Dominating sets in directed graphs

Information Sciences, 2010
Chaoyi Pang, Junhu Wang
exaly  

Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

IEEE Transactions on Parallel and Distributed Systems, 2006
Jie Wu, Shuhui Yang
exaly