This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A332407 #10 Feb 16 2025 08:33:59 %S A332407 0,0,0,0,0,1,6,85,2574,193486 %N A332407 Number of simple graphs on n unlabeled nodes with upper domination number greater than independence number. %C A332407 The upper domination number of a graph is the maximum cardinality of a minimal dominating set. For any graph the upper domination number is greater than or equal to the independence number. This sequence gives the number of graphs where it is strictly greater than. %C A332407 The m X n rook graphs with 2 <= m < n are a class of graph with this property because the independence number is m, and a row of n rooks is minimally dominating. %H A332407 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependenceNumber.html">Independence Number</a> %H A332407 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalDominatingSet.html">Minimal Dominating Set</a> %H A332407 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RookGraph.html">Rook Graph</a> %e A332407 The a(6) = 1 graph illustrated below has independence number 2 and upper domination number 3. %e A332407 *--------o %e A332407 | \ / | %e A332407 | *--o | %e A332407 | / \ | %e A332407 *--------o %e A332407 The above graph is the 2 X 3 rook graph, drawn to show all edges. %e A332407 The three vertices marked with an asterisk are a minimal dominating set. %Y A332407 Cf. A263341, A332403. %K A332407 nonn,more %O A332407 1,7 %A A332407 _Andrew Howroyd_, Feb 15 2020