Timeline for Computing subgraph orbits
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2016 at 22:14 | comment | added | Brendan McKay | Since the group is quite small, just look at each labelled subgraph that is of interest and reject it if it is not the smallest of its 60 images under the group. Define "smallest" however you please (any total order on labelled graphs). The average number of tests per subgraph will only be about 2, so this is quite efficient. | |
| Jun 15, 2016 at 15:14 | comment | added | Bill B | @BrendanMcKay I am depressingly aware of the large number of subgraphs but I don't want every one of them. Initially I wanted isomorphism classes of subgraphs, but due to a (for lack of a better term) "chirality" consideration, this is too coarse and I need representatives of the orbits (perhaps ismorphism classes are the place to start?). The group is $A_5$, the alternating group on $5$ letters. | |
| Jun 15, 2016 at 3:38 | comment | added | Brendan McKay | Given that there are at least $2^{121}$ connected subgraphs, probably you need to reduce your aims. Are you after some very limited type of subgraph perhaps? And how large is the group? | |
| Jun 15, 2016 at 0:54 | review | First posts | |||
| Jun 15, 2016 at 0:58 | |||||
| Jun 15, 2016 at 0:52 | history | asked | Bill B | CC BY-SA 3.0 |