Graph generators¶
Classic¶
|
Returns the perfectly balanced r-ary tree of height h. |
|
Returns the Barbell Graph: two complete graphs connected by a path. |
Returns the Binomial Tree of order n. |
|
|
Return the complete graph K_n with n nodes. |
|
Returns the complete multipartite graph with the specified subset sizes. |
|
Returns the circular ladder graph $CL_n$ of length n. |
|
Generates the circulant graph $Ci_n(x_1, x_2, …, x_m)$ with $n$ vertices. |
|
Returns the cycle graph $C_n$ of cyclically connected nodes. |
|
Returns the hierarchically constructed Dorogovtsev-Goltsev-Mendes graph. |
|
Returns the empty graph with n nodes and zero edges. |
|
Creates a full r-ary tree of n vertices. |
|
Returns the Ladder graph of length n. |
|
Returns the Lollipop Graph; K_m connected to P_n. |
|
Returns the Null graph with no nodes or edges. |
|
Returns the Path graph P_n of linearly connected nodes. |
|
Return the star graph |
|
Return the Trivial graph with one node (with label 0) and no edges. |
|
Return the Turan Graph |
|
Return the wheel graph |
Social Networks¶
Returns Zachary’s Karate Club graph. |
|
Returns Davis Southern women social network. |
|
Returns Florentine families graph. |
|
Returns coappearance network of characters in the novel Les Miserables. |