Timeline for Unique naming/labeling of $40$-node strongly regular graphs
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 15, 2021 at 12:02 | comment | added | Bill Bradley | @GordonRoyle , I am extremely sympathetic to your reaction to the teeth-gritting opacity of the language. As for the GI connection, just search for the phrase "graph isomorphism problem". For a possibly clearer explanation, check out Section 1.2.1 here: w3c.github.io/lds-wg-charter/explainer.html#generalProblem , especially the Arnold/Longley paper. (Full disclosure: I'm part of the "Mirabolic Consulting" that gets mentioned in passing.) | |
| Aug 15, 2021 at 3:58 | comment | added | Gordon Royle | I tried to read those documents, but I literally cannot find an actual graph isomorphism / canonicalisation procedure in there. It talks about issuers, and quads, and blank nodes and Hash N-degree quads, and lots of acronyms that lead to other things I don't understand. But I couldn't see anything that I could recognise as graph isomorphism? | |
| Mar 17, 2021 at 13:19 | history | answered | Bill Bradley | CC BY-SA 4.0 |