Lower bounds for the total (distance) $k$-domination number of a graph

Documents similaires

• Another conjecture of TxGraffiti concerning zero forcing and domination in graphs
  par: Davila, Randy R.
  Publié: (2024)
• Estimating the stability number of a random graph using convolutional neural networks
  par: Davila, Randy
  Publié: (2024)
• Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
  par: Caro, Yair, et autres
  Publié: (2024)
• Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$
  par: Akhiiarov, A. R., et autres
  Publié: (2024)
• Independence, induced subgraphs, and domination in $K_{1,r}$-free graphs
  par: Caro, Yair, et autres
  Publié: (2025)