Sign in

An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six.

Gholamreza AbrishamiMichael A. Henning
Published in: Graphs Comb. (2022)
Keyphrases
  • upper bound
  • lower bound
  • small number
  • clustering algorithm
  • computational complexity
  • data sets
  • machine learning
  • decision trees
  • special case
  • graphical models
  • random walk
  • bipartite graph
  • minimum distance