Login / Signup

Bounds on the k-domination number of a graph.

Ermelinda DeLaViñaWayne GoddardMichael A. HenningRyan PepperEmil R. Vaughan
Published in: Appl. Math. Lett. (2011)
Keyphrases
  • small number
  • graph structure
  • real time
  • data sets
  • information retrieval
  • information systems
  • case study
  • random walk
  • structured data
  • finite number
  • graph theoretic