nauty

• run on https://cocalc.com/features/sage

!geng 4 -c
v1 = list(graphs.nauty_geng("4 -c"))
print([g.size() for g in v1]) # [3, 3, 4, 4, 5, 6]

option

• -c connected

memo

• !geng 1 -c A001349 Number of simple connected graphs on n unlabeled nodes.

format

• Sage에서 시각화 가능

Graph("CF")

-g graph6 (default)

!geng 1 -c -g
@

!geng 2 -c -g
A_

!geng 3 -c -g
BW
Bw

!geng 4 -c -g
CF
CU
CV
C]
C^
C~

-s sparse6

!geng 1 -c -s
:@

!geng 2 -c -s
:An

!geng 3 -c -s
:BoN
:BcN

!geng 4 -c -s
:CwI
:Co`
:Co`V
:CoKN
:CoKI
:CcKI

adjacency matrix

!geng 3 -c | showg -a

Graph 1, order 3.
001
001
110

Graph 2, order 3.
011
101
110

dreadnaut

!geng 3 -c | showg -c

;n3g2;2.
;n3g1 2;2.

edges

!geng 3 -c | showg -e

Graph 1, order 3.
3 2
0 2  1 2

Graph 2, order 3.
3 3
0 1  0 2  1 2