graphs of order n

graphs of order n

asked 2019-08-03 15:13:02 +0100

GA316
129 ●6 ●12 ●20

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.

answered 2019-08-03 22:56:02 +0100

slelievre
17704 ●22 ●160 ●350 http://carva.org/samue...

The documentation is at

http://doc.sagemath.org/html/en/reference/graphs/

and especially

http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/graph_generators.html

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.

edit flag offensive delete link

Comments

Thank you. one doubt. graphs(5) gives the list of graphs up to isomorphism?

GA316 ( 2019-08-04 08:32:11 +0100 )edit

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.

slelievre ( 2019-08-04 13:02:19 +0100 )edit

add a comment

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

1 Answer

Comments

Your Answer

Question Tools

Stats

Related questions

graphs of order n edit

1 Answer

Comments