Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with nauty
Search options not deleted
user 75308
Questions about the program Nauty (No AUTomorphisms, Yes?) used for studying isomorphisms of graphs.
0
votes
2
answers
371
views
Generate all non-isomorphic partitions $\pi = \{ \{1, ..., n-1\}, \{n\} \}$ for all graphs o...
black vertex to the second cluster $C_2$
However, the following graph 4 is isomorphic to graph 3,
Any idea how I can approach that problem in a computationally efficient way by e.g. using geng from nauty …
- 17k