1. Deterministic Graph Generators

1.1. igraph_create — Creates a graph with the specified edges.
1.2. igraph_small — Shortand to create a short graph, giving the edges as agruments
1.3. igraph_adjacency — Creates a graph object from an adjacency matrix.
1.4. igraph_star — Creates a star graph, every vertex connects only to the center.
1.5. igraph_lattice — Creates most kind of lattices.
1.6. igraph_ring — Creates a ring graph, a one dimensional lattice.
1.7. igraph_tree — Creates a tree in which almost all vertices have the same number of children.
1.8. igraph_full — Creates a full graph (directed or undirected, with or without loops).
1.9. igraph_full_citation — Creates a full citation graph
1.10. igraph_famous — Create a famous graph by simply providing its name
1.11. igraph_lcf — Create a graph from LCF notation
1.12. igraph_lcf_vector — Create a graph from LCF notation
1.13. igraph_atlas — Create a small graph from the “Graph Atlas”.
1.14. igraph_de_bruijn — Generate a de Bruijn graph.
1.15. igraph_kautz — Generate a Kautz graph.
1.16. igraph_extended_chordal_ring — Create an extended chordal ring
1.17. igraph_connect_neighborhood — Connects every vertex to its neighborhood