Results 241 to 250 of about 1,397,008 (283)

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

Secure Total Domination Number in Maximal Outerplanar Graphs

Discrete Applied Mathematics
A subset $S$ of vertices in a graph $G$ is a secure total dominating set of $G$ if $S$ is a total dominating set of $G$ and, for each vertex $u \not\in S$, there is a vertex $v \in S$ such that $uv$ is an edge and $(S \setminus \{v\}) \cup \{u\}$ is also
Yasufumi Aita, Toru Araki
semanticscholar   +1 more source

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

Disjunctive Total Domination Subdivision Number of Graphs

Fundamenta Informaticae, 2020
A set S ⊆ V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it. The disjunctive total domination number is the minimum cardinality of a disjunctive total dominating set in G. We define the disjunctive total domination subdivision number of G as the minimum number of
Ciftci, Canan, Aytac, Vecdi
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

Relating the annihilation number and the total domination number for some graphs

Discrete Applied Mathematics, 2023
Xinying Hua, Kexiang Xu, Hongbo Hua
semanticscholar   +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

A new upper bound on the total domination number in graphs with minimum degree six

Discrete Applied Mathematics, 2021
Michael A. Henning, Anders Yeo
semanticscholar   +1 more source