Login / Signup

A bound on the size of a graph with given order and bondage number.

Bert L. HartnellDouglas F. Rall
Published in: Discret. Math. (1999)
Keyphrases
  • maximum number
  • graph theory
  • computational complexity
  • exponential size
  • grow exponentially
  • upper bound
  • small number
  • graph theoretic
  • largest number
  • database
  • learning algorithm
  • case study
  • lower bound