Graph Theory
Named Graphs
compute properties of a named graph
Pappus graph
12-wheel graph
(10,8) cage graph
specify graphs with symbolic parameters
n-complete graph
(n,k)-Turan graph edge count
compare several graphs
Petersen graph, icosahedral graph
get a graph polynomial
matching polynomial of the Petersen graph
Adjacency Rules
analyze a graph specified by adjacency rules
1->2, 2->3, 3->1, 3->4, 4->1
compute an Eulerian cycle
1->2, 2->3, 3->1 eulerian cycle
Random Graphs
create a random graph with a fixed number of vertices
random graph on 12 vertices
specify number of vertices and edges
random graph 10 vertices 15 edges
compute properties of a regular k-ary tree
binary tree
specify the number of levels