# graphs of order n

How to generate all the graphs of particular order $n$ in sage?

is it possible to do the same up to isomorphism at least for small $n$?

Thank you.

graphs of order n

How to generate all the graphs of particular order $n$ in sage?

is it possible to do the same up to isomorphism at least for small $n$?

Thank you.

add a comment

2

The documentation is at

and especially

In particular the following generators exist:

```
sage: graphs(5)
<generator object GraphGenerators.__call__ at 0x...>
sage: graphs.nauty_geng("5")
<generator object GraphGenerators.nauty_geng at 0x...>
sage: graphs.nauty_geng("5 -c")
<generator object GraphGenerators.nauty_geng at 0x...>
```

and there are many more options to nauty's geng.

The documentation can be accessed with `?`

:

```
sage: graphs?
```

and it says this generator produces one representative for each isomorphism class.

To get "all graphs", run through all subsets of the set of unordered pairs of integers among the first n integers and construct the corresponding graphs.

Asked: **
2019-08-03 08:13:02 -0500
**

Seen: **46 times**

Last updated: **Aug 03 '19**

Iterating over all non isomorphic connected graphs of given order

Is there a way to draw a graph using a specific embedding?

Combine two graphs by merging a vertex

fractional_chromatic_index in sage-7.6 gets stuck in loop adding constraints

How do I print a graph after I find all_graph_colorings?

Changing the text in a vertex of a graph

How to take an initial segment of the data structure graphs(n) ?

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.