A bipartite graph (X, Y ) in which X and Y are, respectively, the set of all l-subsets and all k-subsets of a v-set V as vertices and two vertices being adjacent 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 dominating sets for Γ(v, k, l, 2), where 4 ≤ k ≤ 6 and 3 ≤ l ≤ 5.
[1] I. Anderson, Combinatorial Designs and Tournaments, Oxford University Press, 1997. [2] D. B. West, Introduction to Graph Theory, 2nd Edition, Prentice Hall, 2001. [3] W. Fish, N. B. Mumba, E. Mwambene and B. G. Rodrigues, Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs Γ(2k + 1; k; k + 2; 1), Graphs Combin. 33 (2) (2017) 357-368, https://doi.org/10.1007/s00373-017-1765-8.
Bahmani,A , Emami,M and Naserian,O . (2023). Dominating Set for Bipartite Graph Γ(v, k, l, 2). Mathematics Interdisciplinary Research, 8(1), 19-25. doi: 10.22052/mir.2022.246511.1360
MLA
Bahmani,A , , Emami,M , and Naserian,O . "Dominating Set for Bipartite Graph Γ(v, k, l, 2)", Mathematics Interdisciplinary Research, 8, 1, 2023, 19-25. doi: 10.22052/mir.2022.246511.1360
HARVARD
Bahmani A, Emami M, Naserian O. (2023). 'Dominating Set for Bipartite Graph Γ(v, k, l, 2)', Mathematics Interdisciplinary Research, 8(1), pp. 19-25. doi: 10.22052/mir.2022.246511.1360
CHICAGO
A Bahmani, M Emami and O Naserian, "Dominating Set for Bipartite Graph Γ(v, k, l, 2)," Mathematics Interdisciplinary Research, 8 1 (2023): 19-25, doi: 10.22052/mir.2022.246511.1360
VANCOUVER
Bahmani A, Emami M, Naserian O. Dominating Set for Bipartite Graph Γ(v, k, l, 2). Math. Interdisc. Res.. 2023;8(1):19-25. doi: 10.22052/mir.2022.246511.1360
