Dominating sets for uniform subset graphs

Let v, k, t be positive integers and let G(v, k, t) be the uniform subset graph, defined by all k-subsets of a v-set as its vertices with edges connecting all k-subsets intersecting exactly at t elements. In this paper, we give non-trivial dominating sets for G(v, k,2)-graphs and their complements fork = 3, 4, 5, 6. The given domination numbers of some of these graphs are sharper than the known bounds.