Results 281 to 290 of about 1,521,521 (318)

BOUNDS ON SPLIT TOTAL DOMINATION NUMBER OF GRAPHS

, 2020
A dominating set for a graph G = (V,E) is a subset D of V such that that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. In this paper a new parameter,
T. Brindha, R. Subiksha
semanticscholar   +1 more source

Graphs with equal secure total domination and inverse secure total domination numbers

Journal of Information and Optimization Sciences, 2018
AbstractA secure total dominating set of a graph G = (V, E) is a total dominating set D ⊆ V(G) with the property that for each u ∈ V(G) – D, there exists v ∈ D adjacent to u such that (D – {v}) ∪ {u} is a total dominating set. If V(G) – D contains a secure total dominating set D´ of G, then D´ is called an inverse secure total dominating set with ...
V. R. Kulli, B. Chaluvaraju, M. Kumara
openaire   +1 more source

Graphs with Large Total 2-Rainbow Domination Number

Iranian Journal of Science and Technology, Transactions A: Science, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahzadeh Ahangar, H., Khaibari, M., Jafari Rad, N., Sheikholeslami, S. M.   +3 more
openaire   +2 more sources

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

Discrete Applied Mathematics, 2023
Ismael Ríos Villamar, Abel Cabrera Martínez, J. L. Sánchez, J. Sigarreta   +3 more
semanticscholar   +1 more source

TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS

Discrete Mathematics, Algorithms and Applications, 2013
A set S of vertices of a graph G is a total outer-connected dominating set if every vertex in V(G) is adjacent to some vertex in S and the subgraph G[V\S] induced by V\S is connected. The total outer-connected domination numberγ toc (G) is the minimum size of such a set.
Favaron, O., Khoeilar, R., Sheikholeslami, S. M.   +2 more
openaire   +2 more sources

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

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

Graphs with Diameter 2 and Large Total Domination Number

Graphs Comb., 2020
A. Dubickas
semanticscholar   +2 more sources

On Total Domination Number of Hypercube and Enhanced Hypercube Networks

, 2021
S. Prabhu, S. Deepa, G. Murugan, M. Arulperumjothi   +3 more
semanticscholar   +1 more source