Figure - available from: SN Operations Research Forum
This content is subject to copyright. Terms and conditions apply.
Source publication
![A tree with one father and j+1\documentclass[12pt]{minimal}...](publication/363231393/figure/fig5/AS:11431281087220291@1664505381677/A-tree-with-one-father-and-j-1documentclass12ptminimal-usepackageamsmath_Q320.jpg)
A set D of vertices in a graph G is a k-fair dominating set if every vertex not in D is adjacent to exactly k vertices in D. The weighted k-fair domination number \(\mathrm {wfd}_k(G)\) of a vertex-weighted graph G is the minimum weight w(D) among all k-fair dominating sets D. In addition to the weighted k-fair domination number, some auxiliary par...
Similar publications
A vertex-edge perfect Roman dominating function on a graph $ G = (V, E) $ (denoted by ve-PRDF) is a function $ f:V\left(G\right)\longrightarrow\{0, 1, 2\} $ such that for every edge $ uv\in E $, $ \max\{f(u), f(v)\}\neq0 $, or $ u $ is adjacent to exactly one neighbor $ w $ such that $ f(w) = 2 $, or $ v $ is adjacent to exactly one neighbor $ w $...
For an integer $k\geq1,$ a Roman $\{k\}$-dominating function (R$\{k\}$DF) on a graph $G=(V,E)$ is a function $f:V\rightarrow\{0,1,\dots,k\}$ such that for every vertex $v\in V$ with $f(v)=0$, $\sum_{u\in N(v)}f(u)\geq k$, where $N(v)$ is the set of vertices adjacent to $v.$ The weight of an R $\{k\}$DF is the sum of its function values over the who...
A distance-2 dominating set D⊆V of a graph G is a acyclic distance-2 dominating set if the induced sub graph is a acyclic. The acyclic distance-2 dominating number is the minimum cardinality of a acyclic distance-2 dominating set. In this paper, we defined the notion of acyclic distance-2 domination in graph. We got many bounds on acyclic distance-...
A double Roman dominating function (DRDF) on a graph G=(V,E) is a function f:V→{0,1,2,3} such that every vertex u with f(u) = 0 is adjacent to at least one vertex assigned a 3 or to at least two vertices assigned a 2, and every vertex v with f(v) = 1 is adjacent to at least one vertex assigned 2 or 3. The weight of a DRDF is the sum of its function...
A dominating set D ⊆ V (G) is said to be a congruent dominating set of G if v∈V (G) d(v) ≡ 0 mod v∈D d(v). The minimum cardinality of a minimal congruent dominating set of G is called the congruent domination number of G which is denoted by γ cd (G). Some characterizations are established and congruent domination number for various graphs have been...
