# Deterministic graph generators

## About generators

Most functions that create graphs in a deterministic manner are documented here. See also stochastic generators, spatial graph generators, bipartite graph generators, and operators that transform graphs.

## Basic graph creation

## Graphs from adjacency matrices and adjacency lists

These functions create graphs from weighted or unweighted adjacency matrices, or an adjacency list.

## Regular structures

These functions produce various basic regular graph structures, such as paths, cycles or lattices.

## Tree generators

These functions generate tree graphs.

## Graphs with given degrees

These functions generate graphs with the specified degrees.

## Complete graphs

These functions produce single and multipartite complete graphs, as well as related graphs.

## Pre-defined graphs

These functions return graphs from various graph collections.

## Other well-known graphs from graph theory