Login / Signup

The secure domination number of Cartesian products of small graphs with paths and cycles.

Michael HaythorpeAlex Newcombe
Published in: Discret. Appl. Math. (2022)
Keyphrases
  • small number
  • computational complexity
  • maximum number
  • small fraction
  • customer demand
  • data sets