Results 261 to 270 of about 12,767 (290)

Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs

Graphs and Combinatorics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Camino Balbuena, Adriana Hansberg, Teresa W. Haynes, Michael A. Henning   +3 more
openaire   +2 more sources

Total Version of the Domination Game

Graphs and Combinatorics, 2014
In this paper, we continue the study of the domination game in graphs introduced by Brešar, Klavžar, and Rall [SIAM J. Discrete Math. 24 (2010) 979–991].
Michael A Henning, Sandi Klavžar, Douglas F Rall   +2 more
exaly   +1 more source

k-tuple total domination in graphs

Discrete Applied Mathematics, 2010
A set S of vertices in a graph G is a k-tuple total dominating set, abbreviated kTDS, of G if every vertex of G is adjacent to least k vertices in S. The minimum cardinality of a kTDS of G is the k-tuple total domination number of G.
Michael A Henning, Adel P Kazemi
exaly   +2 more sources

The minus total k-domination numbers in graphs

Discrete Mathematics, Algorithms and Applications, 2021
For any integer [Formula: see text], a minus total [Formula: see text]-dominating function is a function [Formula: see text] satisfying [Formula: see text] for every [Formula: see text], where [Formula: see text]. The minimum of the values of [Formula: see text], taken over all minus total [Formula: see text]-dominating functions [Formula: see text ...
Jonecis A. Dayap, Nasrin Dehgardi, Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami   +3 more
openaire   +2 more sources

Graphs with large total domination number

Journal of Graph Theory, 2000
A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called total dominating in \(G\), if each vertex of \(G\) is adjacent to a vertex of \(S\). The minimum number of vertices of a total dominating set in \(G\) is the total domination number \(\gamma_t(G)\) of \(G\).
openaire   +2 more sources

A New Bound on the Total Domination Subdivision Number

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron, Hossein Karami 0002, R. Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
openaire   +1 more source

Bounds on the Total Restrained Domination Number of a Graph

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert   +2 more
openaire   +1 more source

Total Dominator Total Chromatic Numbers of Some Graphs

Utilitas Mathematica
Total dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The minimum namber of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph.
Vusuqi, Leila, Kazemi, Adel P., Kazemnejad, Farshad   +2 more
openaire   +2 more sources

On the Total Domination Number of Cartesian Products of Graphs

Graphs and Combinatorics, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning, Douglas F. Rall
openaire   +2 more sources

On domination and total domination number of a collaboration graph

International Journal of Advanced Intelligence Paradigms, 2017
Venkataraman Yegnanarayanan, A. Renuka Lakshmi, Valentina Emilia Balas   +2 more
openaire   +1 more source