Results 281 to 290 of about 11,106,432 (291)
Some of the next articles are maybe not open access.

Trees with equal average domination and independent domination numbers.

Ars Comb., 2004
Let \(v\) be a vertex of a graph \(G=(V,E)\). The domination number of \(G\) relative to \(v\), \(\gamma_v(G)\), is the minimum cardinality of a dominating set in \(G\) that contains \(v\). The average domination number of \(G\) is \(\gamma_{av}(G)=\frac{1}{| V| }\sum_{v\in V} \gamma_v(G)\).
openaire   +2 more sources

Domination versus independent domination in graphs of small regularity

Discrete Mathematics, 2020
Michael Henning, Ammar Babikir
exaly  

Independent Domination in Cubic Graphs

Journal of Graph Theory, 2015
Michael Henning
exaly  

On the Total Outer k-Independent Domination Number of Graphs

Mathematics, 2020
Ernesto Parra-Inza   +2 more
exaly  

On k-rainbow independent domination in graphs

Applied Mathematics and Computation, 2018
Tadeja Kraner Šumenjak   +2 more
exaly  

On trees with equal 2-domination and 2-outer-independent domination numbers

Indian Journal of Pure and Applied Mathematics, 2015
Marcin Krzywkowski
exaly  

Independent Roman {2}-domination in graphs

Discrete Applied Mathematics, 2018
exaly  

Home - About - Disclaimer - Privacy