A proof of a conjecture of minus domination in graphs

  • Authors:

  • Chunxiang Wang;Jingzhong Mao

  • Affiliations:

  • Department of Mathematics, Central China Normal University, Wuhan, Hubei 430079, China;Department of Mathematics, Central China Normal University, Wuhan, Hubei 430079, China

  • Venue:
  • Discrete Mathematics
  • Year:
  • 2002

Quantified Score

Hi-index 0.05

Visualization

Abstract

Let γ-(G) be the minus domination number of a graph G. It has been conjectured in Discrete Math. 199 (1999) 35 that γ-(G) ≥ 4((1 + n)1/2 - 1) - n for all bipartite graph of order n. In this paper we prove this conjecture.