Yeshwant Pandit

most citedSome results on domination number of the graph defined by two levels of the n-cube

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

math.CO2019★ 2 cited

Some results on domination number of the graph defined by two levels of the n-cube

Yeshwant Pandit, S. L. Sravanthi, Suresh Dara +1

Let $(k [ n ])$ and $(l [ n ])$ $(k > l)$ where $[n] = {1, 2, 3, ..., n}$ denote the family of all $k$ -element subsets and $l$ -element subsets of $[n]$ respectively. D…