摘要

Let gamma(G) and i(G) be the domination number and the independent domination number of G, respectively. Rad and Volkmann posted a conjecture that i(G)/gamma(G) <= Delta(G)/2 for any graph G, where Delta(G) is its maximum degree (see N. J. Rad, L. Volkmann (2013)). In this work, we verify the conjecture for bipartite graphs. Several graph classes attaining the extremal bound and graphs containing odd cycles with the ratio larger than Delta(G)/2 are provided as well.

  • 出版日期2017-6