A dominating set D of a connected graph G=(V, E) G=(V, E) is said to be bi-connected
dominating set if the induced subgraphs of both ⟨ D ⟩⟨ D⟩ and ⟨ VD ⟩⟨ VD⟩ are …

A dominating set D⊆ V is a co-independent dominating (CID)-set a graph G=(V, E) if∆(〈 V−
D〉)= 0. The co-independent domination number γci (G) is the minimum cardinality of a co …

In this paper we disprove a result on the PBIB designs arising from γ _ bc γ bc-sets in Q_ 4 Q
4, with m= 4 m= 4 association schemes proved by Chaluvaraju et al.(Afr Math 29: 47–63 …

Abstract A set D ⊆ V (G) D⊆ V (G) is a bi-independent dominating (BID) set of a graph
G=(V, E) G=(V, E), if Δ (⟨ D ⟩)= Δ (⟨ VD ⟩)= 0 Δ (⟨ D⟩)= Δ (⟨ VD⟩)= 0, where Δ (G) Δ (G) is …

A set D of vertices of a connected graph G=(V, E) is a co-connected dominating set if every
vertex not in D is adjacent to some vertex in D and the subgraph induced〈 V− D〉 is …