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 9025
Questions about the program Nauty (No AUTomorphisms, Yes?) used for studying isomorphisms of graphs.
7
votes
Accepted
An example of when nauty, on two different platforms, gives different canonical labels for t...
It's only possible if there's a bug, and since there are no bugs it doesn't happen.
- 37.7k
8
votes
Accepted
Details of generation programs supplied with nauty
The best place for technical questions about nauty is the mailing list.
Anyway, the parent of a graph $G$ is a graph $G-v$ where $v$ is some vertex. …
- 37.7k
10
votes
Accepted
Is there an algorithm to generate graphs with given order and diameter?
About 58% of the graphs on 12 vertices have diameter 3, so filtering a complete generation will be as fast as any. On 20 vertices the fraction has dropped to about 31% but the total is so vast that g …
- 37.7k