A Tight Upper Bound on the Average Order of Dominating Sets of a Graph.

Iain Beaton Ben Cameron

Published in: CoRR (2022)

Keyphrases

database
computer vision
e learning
case study
lower bound
probabilistic model
graph structure
graph theoretic