Results 81 to 90 of about 11,159 (184)
On Secure Total Domination Cover Pebbling Number
S. Sarah Surya, Lian Mathew
openalex +2 more sources
On the total k-domination number of graphs
Let k be a positive integer and let G = (V,E) be a simple graph. The k-tuple domination number γ×k(G) of G is the minimum cardinality of a k-tuple dominating set S, a set that for every vertex v ∈ V , |NG[v]∩S| ≥ k. Also the total k-domination number γ×k,t(G) of G is the minimum cardinality of a total k -dominating set S, a set that for every vertex v ∈
openaire +2 more sources
Proper total domination in graphs [PDF]
Ritabrato Chatterjee +3 more
doaj +1 more source
On the signed strong total Roman domination number of graphs
A. Mahmoodi +2 more
openalex +2 more sources
Bounds on the locating-total domination number of a tree
Xue-gang Chen, Moo Young Sohn
openalex +1 more source
Total domination multisubdivision number of a graph
Diana Avella-Alaminos +3 more
openalex +2 more sources
On the global total
Sergio Bermudo +3 more
openalex +1 more source

