[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 …
GRAPH THEORETIC PARAMETERS ASSOCIATED WITH PBIB DESIGN VIA PARTIAL GEOMETRIES OF GENERALIZED POLYGON.
B Chaluvaraju, SM Hosamani… - South East Asian …, 2020 - search.ebscohost.com
Abstract Due to Feit and Higman [12], the (thick) generalized n-gons exist only for n є {2, 3, 4,
6, 8} and are apparently quite rare for n= 6 or 8. By virtue of the above fact, in this article, we …
6, 8} and are apparently quite rare for n= 6 or 8. By virtue of the above fact, in this article, we …
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] DESIGN VIA PARTIAL GEOMETRIES OF GENERALIZED POLYGON
Due to Feit and Higman [12], the (thick) generalized n-gons exist only for n∈{2, 3, 4, 6, 8}
and are apparently quite rare for n= 6 or 8. By virtue of the above fact, in this article, we …
and are apparently quite rare for n= 6 or 8. By virtue of the above fact, in this article, we …