Login / Signup

A lower bound on the total vertex-edge domination number of a tree.

B. SenthilkumarH. Naresh KumarYanamandram B. Venkatakrishnan
Published in: Discret. Math. Algorithms Appl. (2021)
Keyphrases
  • lower bound
  • upper bound
  • undirected graph
  • computational complexity
  • spanning tree
  • search algorithm
  • tree structure
  • data structure
  • search space
  • multi dimensional
  • main memory
  • memory requirements
  • finite number