Results 1 to 10 of about 8,468 (237)
Independent roman $\{3\}$-domination [PDF]
Transactions on Combinatorics, 2022 Let $G$ be a simple, undirected graph. In this paper, we initiate the study of independent Roman $\{3\}$-domination. A function $g : V(G) \rightarrow \lbrace 0, 1, 2, 3 \rbrace$ having the property that $\sum_{v \in N_G(u)}^{} g(v) \geq 3$, if $g(u) = 0$,
P. Chakradhar, P. Venkata Subba Reddy
doaj +2 more sources
Domination and Independent Domination in Hexagonal Systems [PDF]
Mathematics, 2021 A vertex subset D of G is a dominating set if every vertex in V(G)\D is adjacent to a vertex in D. A dominating set D is independent if G[D], the subgraph of G induced by D, contains no edge.
Norah Almalki, Pawaton Kaemawichanurat
doaj +2 more sources
Independent partial domination
Cubo, 2021 For $p\in(0,1]$, a set $S\subseteq V$ is said to $p$-dominate or partially dominate a graph $G = (V, E)$ if $\frac{|N[S]|}{|V|}\geq p$. The minimum cardinality among all $p$-dominating sets is called the $p$-domination number and it is denoted by ...
L. Philo Nithya +1 more
doaj +3 more sources
Domination Number, Independent Domination Number and 2-Independence Number in Trees
Discussiones Mathematicae Graph Theory, 2021 For a graph G, let γ(G) be the domination number, i(G) be the independent domination number and β2(G) be the 2-independence number. In this paper, we prove that for any tree T of order n ≥ 2, 4β2(T) − 3γ(T) ≥ 3i(T), and we characterize all trees ...
Dehgardi Nasrin +4 more
doaj +2 more sources
Independent Transversal Total Domination Versus Total Domination in Trees
Discussiones Mathematicae Graph Theory, 2021 A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera +2 more
doaj +5 more sources
Independent [1,2]-number versus independent domination number [PDF]
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017 A [1; 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbors in it. If the additional requirement that the set be independent is added, the existence of such sets is not guaranteed in every ...
Aleid Sahar A. +2 more
doaj +4 more sources
Graphs with equal domination and independent domination numbers [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Let γ(G) and i(G) denote the domination number and independent domination number of a graph G. In this article, we establish a sufficient condition for a graph G to satisfy which yields some of the well known classical theorems as corollaries.
Purnima Gupta, Rajesh Singh, S. Arumugam
doaj +2 more sources
Domination and Independent Domination in Extended Supergrid Graphs
Algorithms, 2022 Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied the Hamiltonian-related properties of supergrid graphs and their subclasses of graphs. In this paper, we propose a generalized graph
Jong-Shin Chen +3 more
doaj +2 more sources
Outer-independent k-rainbow domination [PDF]
Journal of Taibah University for Science, 2019 An outer-independent k-rainbow dominating function of a graph G is a function f from $V(G) $ to the set of all subsets of $\{1,2,\ldots ,k\} $ such that both the following hold: (i) $\{1,\ldots ,k\}=\bigcup _{u\in N(v)} f(u) $ whenever v is a vertex with
Qiong Kang +4 more
doaj +2 more sources
Discussiones Mathematicae Graph Theory, 2022 A 2-rainbow dominating function (2RDF) of a graph G is a function g from the vertex set V (G) to the family of all subsets of {1, 2} such that for each vertex v with g(v) =∅ we have ∪u∈N(v) g(u) = {1, 2}.
Poureidi Abolfazl, Rad Nader Jafari
doaj +2 more sources