GraphTheory[SpecialGraphs] - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : SpecialGraphs : GraphTheory/SpecialGraphs/GeneralizedBlanusaSnark

GraphTheory[SpecialGraphs]

  

GeneralizedBlanusaSnark

  

construct generalized Blanusa snark graph

 

Calling Sequence

Parameters

Description

Examples

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

withGraphTheory:

withSpecialGraphs:

CGeneralizedBlanusaSnark1,1

C:=Graph 1: an undirected unweighted graph with 18 vertices and 27 edge(s)

(1)

DrawGraphC

CGeneralizedBlanusaSnark2,1

C:=Graph 2: an undirected unweighted graph with 18 vertices and 27 edge(s)

(2)

DrawGraphC

See Also

PetersenGraph

SpecialGraphs

 


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam