Results 31 to 40 of about 11,572,072 (152)
An Upper Bound for the Independent Domination Number
Journal of Combinatorial Theory, Series B, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang Sun, Jianfang Wang
openaire +2 more sources
On graphs whose domination numbers equal their independent domination numbers
Electronic Notes in Discrete Mathematics, 2003 Abstract In this paper, we extend a result due to R. B. Allan and R. C. Laskar on graphs whose independent domination numbers equal their domination numbers. We will consider finite simple graphs as treated in most of the standard text-books on Graph Theory (e.g., see D. B. West [1]). Let G = (V,E) be any graph and D ⊆ V. We let N(D) denote the set
B. Devadas Acharya, Purnima Gupta
openaire +2 more sources
On the Outer Independent Double Roman Domination Number [PDF]
Bulletin of the Iranian Mathematical Society, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh +3 more
openaire +1 more source
A note on the independent domination number versus the domination number in bipartite graphs [PDF]
Czechoslovak Mathematical Journal, 2017 Accepted by Czechoslovak Mathematical ...
Wang, Shaohui, Wei, Bing
openaire +2 more sources
Strong weak domination and domination balance in a graph [PDF]
, 1979 summary:In this paper we extend the notion of weak degree domination in graphs to hypergraphs and find relationships among the domination number, the weak edge-degree domination number, the independent domination number and the independence number of a ...
B.D. Acharya +4 more
core +1 more source
Independent Dominator Sequence Number of a Graph
Procedia Computer Science, 2015 AbstractLet G = (V, E) be a connected graph. A dominator sequence in G is a sequence of vertices S = (v1, v2,. . ., vk) such that for each i with 2 ≤ i ≤ k, the vertex vi dominates at least one vertex which is not dominated by v1, v2,. . ., vi−1. If further the set of vertices in S is an independent set, then S is called an independent dominator ...
S. Arumugam 0001 +2 more
openaire +2 more sources
On the Independent Domination Number of Regular Graphs
Annals of Combinatorics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goddard, Wayne +3 more
openaire +2 more sources
On the outer-independent double Italian domination number
Electronic Journal of Graph Theory and Applications, 2022 Summary: An outer-independent Italian dominating function (OIIDF) on a graph \(G\) is a function \(f : V(G)\longrightarrow \{0, 1, 2\}\) such that every vertex \(v\in V(G)\) with \(f(v)=0\) has at least two neighbors assigned 1 under \(f\) or one neighbor \(w\) with \(f(w)=2\), and the set \(\{u \in V(G)|f(u)=0\}\) is independent.
Noor A'lawiah Abd Aziz +3 more
openaire +2 more sources
A note on domination and independence-domination numbers of graphs
Ars Mathematica Contemporanea, 2012 Vizing's conjecture is true for graphs G satisfying γ i ( G ) = γ ( G ), where γ ( G ) is the domination number of a graph G and γ i ( G ) is the independence-domination number of G , that is, the maximum, over all independent sets I in G , of the minimum number of vertices needed to dominate I . The equality γ i ( G ) = γ (
openaire +4 more sources
Domination and independence subdivision numbers of graphs
Discussiones Mathematicae Graph Theory, 2000 A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). A set \(S\subseteq V(G)\) is independent in \(G\), if no two vertices of \(S\) are adjacent in \(G\).
Teresa W. Haynes +2 more
openaire +3 more sources