LjubljanaGraph - Maple Help

GraphTheory[SpecialGraphs]

 LjubljanaGraph
 construct Ljubljana graph

 Calling Sequence LjubljanaGraph()

Description

 • The LjubljanaGraph() command returns the Ljubljana graph, an undirected bipartite graph with 112 vertices and 168 edges.
 • The Ljubljana graph is a cubic graph and its girth is 10.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{LjubljanaGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 112 vertices and 168 edge\left(s\right)}}$ (1)
 > $\mathrm{DrawGraph}\left(G\right)$

References

 "Ljubljana graph", Wikipedia. http://en.wikipedia.org/wiki/Ljubljana_graph

Compatibility

 • The GraphTheory[SpecialGraphs][LjubljanaGraph] command was introduced in Maple 2016.