From 263805631e2b65c01e6d5cfe110d0f5bbbf90089 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=C3=84min=20Baumeler?= Date: Thu, 4 May 2023 16:46:15 +0000 Subject: [PATCH] Updated README.md: Graph-isomorphism limitation and Mathematica snippet --- README.md | 9 +++++++++ 1 file changed, 9 insertions(+) diff --git a/README.md b/README.md index 08f6fd9..8d33f2b 100644 --- a/README.md +++ b/README.md @@ -76,11 +76,20 @@ Verifying the admissibility of 6 graphs in the file `3.soc' (line 1 to line 6) These graphs are admissible ``` +The SOCs generated can easily be displayed with Mathematica using the following: +``` +SOCs = DirectedGraph[AdjacencyGraph[#]] & /@ ToExpression[Import["./3.soc", "List"]]; +SOCs = DeleteDuplicatesBy[SOCs, CanonicalGraph]; +SOCs +``` + ## Limitations In `SOCgen`, each simple directed graph is represented by a 64bit unsigned integer: This integer is interpreted as a vector of bits, where each bit specifies the absence or presence of a directed edge from one node to another. Since we consider simple directed graphs only (no self-loops), there are `n(n-1)` possible directed edges, where `n` is the number of nodes. This means that the largest number of nodes possible is limited by `n=8`. +While the SOCs generated by `SOCgen` satisfy some degree-order (see function `isdegreeordered(...)` in [SOCgen.c](./SOCgen.c)), `SOCgen` does not perform graph-isomorphism tests, and may output multiple isomorphic graphs. + ## License [GPL-3.0-or-later](./LICENSES/GPL-3.0-or-later.txt) \ No newline at end of file