graph-generators
Python functions to compute various classes of networkx graphs
Requirements
Requires python >= 3.5 and networkx.
Installation
pip install graph-generators
Usage
After installation, run from graph_generators import *
For instance, keller_graph(n) returns an n-dimensional Keller graph.
List of graphs
| Graph name | Function name |
|---|---|
| Keller graph | keller_graph |
| King graph | king_graph |
| Knight graph | knight_graph |
| Antelope graph | antelope_graph |
| Zebra graph | zebra_graph |
| Giraffe graph | giraffe_graph |
| Camel graph | camel_graph |
| (a,b)-leaper graph | leaper_graph |
| Fiveleaper graph | fiveleaper_graph |
| Prism graph | prism_graph |
| Stacked prism graph | stacked_prism_graph |
| Moebius ladder graph | mobius_ladder_graph |
| Book graph | book_graph |
| Stacked book graph | stacked_book_graph |
| Odd graph | odd_graph |
| Fibonacci cube graph | fibonacci_cube_graph |
| Lucas cube graph | lucas_cube_graph |
| Halved cube graph | halved_cube_graph |
| Folded cube graph | folded_cube_graph |
| Johnson graph | johnson_graph |
