Dominating Set for Bipartite Graph Γ(v, k, l, 2)

A bipartite graph (X, Y ) in which X and Y are, respectively, the set ofall l-subsets and all k-subsets of a v-set V as vertices and two vertices beingadjacent if they have i elements in common, is denoted by Γ(v, k, l, i). In this paper, using the structure of Stiener triple systems, we give dominatingsets for Γ(v, k, l, 2), where 4 ≤ k ≤ 6 and 3 ≤ l ≤ 5.