NetworkX

Previous topic

networkx.bipartite_random_regular_graph

Next topic

networkx.balanced_tree

networkx.graph_atlas_g

graph_atlas_g()

Return the list [G0,G1,...,G1252] of graphs as named in the Graph Atlas. G0,G1,...,G1252 are all graphs with up to 7 nodes.

The graphs are listed:
  1. in increasing order of number of nodes;
  2. for a fixed number of nodes, in increasing order of the number of edges;
  3. for fixed numbers of nodes and edges, in increasing order of the degree sequence, for example 111223 < 112222;
  4. for fixed degree sequence, in increasing number of automorphisms.

Note that indexing is set up so that for GAG=graph_atlas_g(), then G123=GAG[123] and G[0]=empty_graph(0)