Domination numbers are known for some infinite families of graphs. Other than trivial results such as for paths or cycles, perhaps the most famous result is the sprawling effort over a 27 year period [1]}, [2]}, [3]}, [4]}, [5]}, [6]} to provide a complete characterisation of domination numbers for grid graphs \(G(n,m)\)  of all possible sizes, consisting of 23 special cases before settling into a standard formula for \(n,m \ge 16\) . Other results for domination include generalized Petersen graphs [7]}, [8]}, [9]}, Cartesian products involving cycles [10]}, [11]}, [12]}, King graphs [13]}, Latin square graphs [14]}, hypercubes [15]}, Sierpiński graphs [16]}, Knödel graphs [17]}, and various graphs from chemistry [18]}, [19]}, among others.
