Login / Signup

An improved upper bound on the independent double Roman domination number of trees.

Fatemeh Nahani PourHossein Abdollahzadeh AhangarMustapha ChellaliSeyed Mahmoud Sheikholeslami
Published in: AKCE Int. J. Graphs Comb. (2022)
Keyphrases
  • upper bound
  • small number
  • neural network
  • computational complexity
  • lower bound
  • worst case
  • error probability
  • real time
  • real world
  • information retrieval
  • image segmentation
  • relational databases