|
GraphTheory[SpecialGraphs][GeneralizedBlanusaSnark]
|
|
Calling Sequence
|
|
GeneralizedBlanusaSnark(T, K)
|
|
|
Parameters
|
|
|
T
|
-
|
type of snark family (1 or 2)
|
|
K
|
-
|
nonnegative integer
|
|
|
|
|
|
Description
|
|
|
•
|
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).
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
>
|
|
|
| (2) |
|
>
|
|
|
|
Download Help Document
Was this information helpful?
