Generalized Blanusa snarks are Isaacs dot products of copies of the Petersen graph.

The argument K specifies the number of Petersen copies (K+1). The type T refers to two possible ways to perform the dot product on two copies of the Petersen graph. In particular, GeneralizedBlanusaSnark(T, 0) is the Petersen graph and GeneralizedBlanusaSnark(T, 1) is the T-th Blanusa snark (T=1,2).

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$\mathrm{with}\left(\mathrm{SpecialGraphs}\right)\:$

$C≔\mathrm{GeneralizedBlanusaSnark}\left(1\,1\right)$

$C≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 18\; vertices\; and\; 27\; edges}$

$\mathrm{DrawGraph}\left(C\right)$

$C≔\mathrm{GeneralizedBlanusaSnark}\left(2\,1\right)$

$C≔\mathrm{Graph\; 2:\; an\; undirected\; graph\; with\; 18\; vertices\; and\; 27\; edges}$

$\mathrm{DrawGraph}\left(C\right)$

Watkins, John J. (1989) "Snarks". Ann N Y Acad Sci. 576 (1): 606-622. doi:10.1111/j.1749-6632.1989.tb16441.x