Results 131 to 140 of about 11,572,072 (152)

On the Independent Domination Number of Random Regular Graphs

Combinatorics, Probability and Computing, 2006
A dominating set $\cal D$ of a graph $G$ is a subset of $V(G)$ such that, for every vertex $v\in V(G)$, either in $v\in {\cal D}$ or there exists a vertex $u \in {\cal D}$ that is adjacent to $v$. We are interested in finding dominating sets of small cardinality. A dominating set $\cal I$ of a graph $G$ is said to be independent if no two vertices of ${
William Duckworth, Nicholas C. Wormald
openaire   +2 more sources

Domination number, independent domination number and k-independence number in trees

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qing Cui, Xu Zou
openaire   +3 more sources

On Independent Domination of Regular Graphs

Journal of Graph Theory, 2023
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
exaly  

On Three Outer-Independent Domination Related Parameters in Graphs

Discrete Applied Mathematics, 2021
Doost Ali Mojdeh, Ismael Gonzalez Yero, Iztok Peterin   +2 more
exaly  

Graphs with Equal Domination and Independent Domination Number

A set S of vertices of a graph G is an independent dominating set of G ifS is an independent set and every vertex not in S is adjacent to a vertex in S. Theindependent domination number of G, denoted by i G , is the minimum cardinality ofan independent dominating set of G.
VAİDYA, S. K., PANDİT, R. M.
openaire   +1 more source

On graphs with equal domination and edge independence numbers

Ars Comb., 1995
Let \(d(G)\) be the dominating number of a graph \(G\), and \(\alpha(G)\) be the edge independence number of \(G\), i.e. the maximum size of a matching in \(G\). The author characterizes regular graphs, unicyclic graphs, block graphs, and locally connected graphs with \(d(G)= \alpha(G)\).
openaire   +2 more sources

Domination, Independent Domination and k-Independence in Trees

Taiwanese Journal of Mathematics, 2022
Baoyindureng Wu
exaly  

On k-Rainbow Independent Domination in Graphs

Applied Mathematics and Computation, 2018
Tadeja Kraner Sumenjak, Aleksandra Tepeh, Douglas Frank Rall   +2 more
exaly  

Independent Domination in Cubic Graphs

Journal of Graph Theory, 2015
Michael A. Henning, Mickaël Montassier, Paul Dorbec   +2 more
exaly  

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