Results 211 to 220 of about 11,901,808 (241)

Partitioning the Vertices of a Graph into Two Total Dominating Sets

Quaestiones Mathematicae, 2016
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjacent to a vertex of S. We study graphs whose vertex set can be partitioned into two total dominating sets. In particular, we develop several sufficient conditions for a graph to have a vertex partition into two total dominating sets.
Delgado, Pamela, Desormeaux, Wyatt J., Haynes, Teresa W.   +2 more
openaire   +3 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   +3 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

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

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

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   +2 more sources

An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems, 2004
Jie Wu, F Dai
exaly  

Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks With Unidirectional Links

IEEE Transactions on Parallel and Distributed Systems, 2002
Jie Wu
exaly  

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

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

ON CONNECTED TOTAL DOMINATING SETS AND CONNECTED TOTAL DOMINATION POLYNOMIAL OF CORONA GRAPHS

Advances and Applications in Discrete Mathematics, 2019
Giovannie M. Entero, Ariel C. Pedrano
openaire   +1 more source