Bounds on Doubly Connected Fair Dominations in Graphs
. A dominating set 𝐃 of graph 𝐆 = (𝐕, 𝐄) is a doubly connected fair dominating set (dcfd-set) if it satisfies the following conditions: (1) the induced subgraphs < 𝐃 > and < 𝐕\𝐃 > are connected and (2) every vertex not in 𝐃 are dominated by the equal number of vertices from 𝐃 . The dcfd(G) is the minimum cardinality of...