construct generalized Blanusa snark graph
type of snark family (1 or 2)
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).
C ≔ GeneralizedBlanusaSnark⁡1,1
C ≔ Graph 1: an undirected unweighted graph with 18 vertices and 27 edge(s)
C ≔ GeneralizedBlanusaSnark⁡2,1
C ≔ Graph 2: an undirected unweighted graph with 18 vertices and 27 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.