In this paper, we present upper bounds for balanced cycle domination number and signed cycle balanced domination number. The exact values of this parameter are ...

In this paper, we present upper bounds for balanced cycle domination number and signed cycle balanced domination number.

Let G=(V,E) be a graph. A function f: E→{−1,0,+1} is said to be a balanced cycle dominating function (BCDF) of G if ∑e∈E(C)f(e)=0 holds for any induced ...

Some upper bounds on the balanced domination number are established, in which one is the best possible bound and the rest are sharp, all the corresponding ...

Oct 11, 2021 · A graph G is called d-balanced if γ b (G) = 0. The novel concept of balanced domination for graphs is introduced.

On the balanced domination of graphs · journal article · research article · Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak ...

Some upper bounds on the balanced domination number are established, in which one is the best possible bound and the rest are sharp, all the corresponding ...

Let G = (VG,EG) be a graph and let NG[υ] denote the closed neighbourhood of a vertex υ in G. A function f: VG ⟶ {−1,0,1} is said to be a balanced dominating ...

to be a homogeneous signed graph. A signed graph Σ is said to be balanced or cycle balanced if all of its cycles are positive, where the sign of a cycle is the.

Definition 1.5 A graph G is domination balanced (d-balanced) if there exists an sd-set D1 and a wd-set D2 such that D1 ∩ D2 = φ.