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 …

Operations in the theory of graphs has a substantial influence in the analytical and factual
dimensions of the domain. In the realm of chemical graph theory, topological descriptor …

A dominating set D of a graph G=(V, E) is a split dominating set if the induced subgraph <
V-D&gt; is disconnected. The split domination number γ< sub> s(G) is the minimum …

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 …

The pairwise balanced designs (PBD's) is a pair (P, B), where P is a finite set of ν points and
B is a family of subsets of P, called blocks such that every two distinct points in P appear in …

However, the Latin square (LS) designs have been studied extensively with some classes of
regular graphs, and their connections with classical graph parameters were not explored …

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 …

ABSTRACT Let G=(V, E) be a graph. A set of edges in G is independent if no two of them are
adjacent. The largest number of edges in such a set is called the edges independence …

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 …

PBIB-Designs and Association Schemes from Minimum Neighborhood Sets of Certain Jump
Sizes of Circulant Graphs Page 1 International J.Math. Combin. Vol.1(2021), 1-10 PBIB-Designs …