Login / Signup

An improved upper bound on the double Roman domination number of graphs with minimum degree at least two.

Rana KhoeilarHossein KaramiMustapha ChellaliSeyed Mahmoud Sheikholeslami
Published in: Discret. Appl. Math. (2019)
Keyphrases
  • upper bound
  • data sets
  • real time
  • neural network
  • lower bound
  • lower and upper bounds
  • constant factor
  • database
  • data structure
  • branch and bound algorithm
  • graph mining
  • maximum number
  • graph theoretic