Title of article
Dominating Set for Bipartite Graph Γ(v, k, l, 2)
Author/Authors
Bahmani ، Abolfazl Department of mathematics - University of Zanjan , Emami ، Mojgan Department of Mathematics - University of Zanjan , Naserian ، Ozra Department of Mathematics - Islamic Azad University, Zanjan Branch
From page
19
To page
25
Abstract
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.
Keywords
Dominating set , bipartite graph , Steiner triple system
Journal title
Mathematics Interdisciplinary Research
Journal title
Mathematics Interdisciplinary Research
Record number
2743509
Link To Document