PBIB-designs and association schemes arising from minimum bi-connected dominating sets of some special classes of graphs
B Chaluvaraju, N Manjunath - Afrika Matematika, 2018 - Springer
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 …
dominating set if the induced subgraphs of both ⟨ D ⟩⟨ D⟩ and ⟨ VD ⟩⟨ VD⟩ are …
[PDF][PDF] Association scheme with PBIB designs for minimum co-independent dominating sets of circulant graphs
B Chaluvaraju, V Lokesha… - Electronic Journal of …, 2022 - ejmaa.journals.ekb.eg
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 …
D〉)= 0. The co-independent domination number γci (G) is the minimum cardinality of a co …
PBIB-designs and association schemes arising from minimum bi-connected dominating sets of hypercubes
MI Huilgol, MD Vidya - Afrika Matematika, 2020 - Springer
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 …
4, with m= 4 m= 4 association schemes proved by Chaluvaraju et al.(Afr Math 29: 47–63 …
PBIB Designs and Their Association Schemes Arising from Minimum Bi-Independent Dominating Sets of Circulant Graphs
B Chaluvaraju, SA Diwakar - New Trends in Applied Analysis and …, 2021 - Springer
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 …
G=(V, E) G=(V, E), if Δ (⟨ D ⟩)= Δ (⟨ VD ⟩)= 0 Δ (⟨ D⟩)= Δ (⟨ VD⟩)= 0, where Δ (G) Δ (G) is …
[PDF][PDF] SPECIAL KIND OF GRAPHS
B Chaluvaraju, N Manjunath - researchgate.net
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 …
vertex not in D is adjacent to some vertex in D and the subgraph induced〈 V− D〉 is …