Article
Keywords:
independent domination number; independent number; subset graph
Summary:
The independent domination number $i(G)$ (independent number $\beta (G)$) is the minimum (maximum) cardinality among all maximal independent sets of $G$. Haviland (1995) conjectured that any connected regular graph $G$ of order $n$ and degree $\delta \le \frac{1}{2}{n}$ satisfies $i(G)\le \lceil \frac{2n}{3\delta }\rceil \frac{1}{2}{\delta }$. For $1\le k\le l\le m$, the subset graph $S_{m}(k,l)$ is the bipartite graph whose vertices are the $k$- and $l$-subsets of an $m$ element ground set where two vertices are adjacent if and only if one subset is contained in the other. In this paper, we give a sharp upper bound for $i(S_{m}(k,l))$ and prove that if $k+l=m$ then Haviland’s conjecture holds for the subset graph $S_{m}(k,l)$. Furthermore, we give the exact value of $\beta (S_{m}(k,l))$.
References:
[1] E. J. Cockayne and S. T. Hedetniemi:
Independence graphs. Proc. 5th Southeast Conf. Comb. Graph Theor. Comput, Utilitas Math., Boca Raton, 1974, pp. 471–491.
MR 0357174
[6] E. J. Cockayne, O. Favaron, C. Payan and A. G. Thomason:
Contributions to the theory of domination, independence and irredundance in graphs. Discrete Math. 33 (1981), 249–258.
DOI 10.1016/0012-365X(81)90268-5 |
MR 0602041