Results 261 to 270 of about 14,893,384 (293)

On the Forcing Domination and the Forcing Total Domination Numbers of a Graph

Graphs and Combinatorics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. John, V. Sujin Flower
openaire   +3 more sources

Relating the total \(\{2\}\)-domination number with the total domination number of graphs

Discret. Appl. Math., 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ismael Ríos Villamar, Abel Cabrera Martínez, J. L. Sánchez, José María Sigarreta   +3 more
openaire   +2 more sources

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 and Paired Domination Numbers of Cylinders

Bulletin of the Malaysian Mathematical Sciences Society, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

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

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

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

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