GraphTheory[SpecialGraphs][CageGraph] - Maple Help

Online Help

All Products    Maple    MapleSim


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

GraphTheory[SpecialGraphs][CageGraph]

Calling Sequence

CageGraph(K, G)

Parameters

K

-

degree of graph

G

-

girth of graph

Description

• 

The CageGraph(K,G) command creates the smallest K-regular graph(s) with girth G. If more than one graph meets these criteria, a sequence of graphs is returned. In the cases where the smallest graph is not known, FAIL is returned.

Examples

withGraphTheory:

withSpecialGraphs:

This is the Petersen graph

C:=CageGraph3,5

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

(1)

DrawGraphC

A sequence of graphs

C3:=CageGraph3,11

C3:=Graph 2: an undirected unweighted graph with 112 vertices and 168 edge(s)

(2)

Not known

CageGraph8,11

FAIL

(3)

See Also

Girth, 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