Automated conjecturing VI : domination number of benzenoids

We demonstrate the use of a conjecturing program that can be a tool for researchers investigating bounds of invariants of chemical graphs by investigating upper bounds for the domination number of a benzenoid. The program is open-source, of general use, and can be used to generate conjectured bounds for any invariant of any class of chemical graphs.