Results 231 to 240 of about 8,253 (248)
Some of the next articles are maybe not open access.
On independent domination of regular graphs
Journal of Graph Theory, 2023Eun-Kyung Cho +2 more
exaly
On three outer-independent domination related parameters in graphs
Discrete Applied Mathematics, 2021Doost Ali Mojdeh +2 more
exaly
On the independent domination polynomial of a graph
Discrete Applied Mathematics, 2021Somayeh Jahari, Saeid Alikhani
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., 1995Let \(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 +1 more source
Domination, Independent Domination and $k$-independence in Trees
Taiwanese Journal of Mathematics, 2022Baoyindureng Wu
exaly
Independent domination polynomial of zero-divisor graphs of commutative rings
Soft Computing, 2022Alper Ülker +2 more
exaly
Trees with equal average domination and independent domination numbers.
Ars Comb., 2004Let \(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 +1 more source
Independent Roman {2}-domination in graphs
Discrete Applied Mathematics, 2018Mustapha Chellali
exaly