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). Inthis paper, using the structure of Stiener triple systems, we give dominat...
Main Authors: | Abolfazl Bahmani, Mojgan Emami, Ozra Naserian |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Kashan
2023-03-01
|
Series: | Mathematics Interdisciplinary Research |
Subjects: | |
Online Access: | https://mir.kashanu.ac.ir/article_113762_7d3a6664c8948aba3ded71d06e848057.pdf |
Similar Items
-
Independent set dominating sets in bipartite graphs
by: Bohdan Zelinka
Published: (2005-01-01) -
Bipartite theory on Neighbourhood dominating and global dominating sets of a graph
by: Yanamandram Balasubramanian Venkatakrishnan, et al.
Published: (2014-01-01) -
On the distance domination number of bipartite graphs
by: Doost Ali Mojdeh, et al.
Published: (2020-10-01) -
A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices
by: Narges Ghareghani, et al.
Published: (2020-04-01) -
Cyclability in bipartite graphs
by: Denise Amar, et al.
Published: (2009-01-01)