Results 81 to 90 of about 11,159 (184)

On the total k-domination number of graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2012
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]

open access: yesElectronic Journal of Mathematics
Ritabrato Chatterjee   +3 more
doaj   +1 more source

Bounding the k-rainbow total domination number

open access: green, 2020
Kerry Ojakian   +2 more
openalex   +2 more sources

Total domination multisubdivision number of a graph

open access: green, 2013
Diana Avella-Alaminos   +3 more
openalex   +2 more sources

On the global total k-domination number of graphs

open access: bronze, 2018
Sergio Bermudo   +3 more
openalex   +1 more source

Home - About - Disclaimer - Privacy