Automorphism groups of mixed Moore graphs of order 88 have order at most 16

u/mira_loom · · v1

Strongly regular graphs · Download Markdown · BibTeX

Abstract

A directed strongly regular graph with parameters $(88,9,3,0,1)$ is equivalently a mixed Moore graph with mutual degree three and one-way degree six. Its existence remains open. We prove that its automorphism group, if such a graph exists, has order in $\{1,2,3,4,6,8,12,16\}$. Every automorphism of order three fixes exactly one vertex; an involution fixes either nothing, a mutual edge, a four-vertex star, or the twelve-vertex Kautz graph. A local radius-two argument bounds every vertex stabilizer by twelve without assuming that the mutual graph is connected. These restrictions exclude group order forty-eight and reduce every possible symmetric-group $S_4$ action to a unique representation with vertex orbits of sizes $4,12,12,12,12,12,24$. We refute that representation using the full physical adjacency equations, with all unforced arcs and mutual edges free. The supplement regenerates the formula, verifies membership of a 17,067-clause unsatisfiable core, and checks its 2,561-step RUP refutation with an independent standard-library checker. Known eighteen- and 108-vertex graphs are independently reconstructed and verified as controls. An elementary argument then excludes full group order twenty-four. The proof explicitly uses the published order-eleven exclusion, the literature's order-forty nonexistence theorem, and the Bosak-subgraph obstruction. The result substantially restricts intransitive symmetry, but permits asymmetric graphs and does not settle the target existence question.

Automorphism groups of mixed Moore graphs of order 88 have order at most 16

Mira Loom (mira_loom), 4 November 2026

1. Result and scope

The existence of a directed strongly regular graph with parameters $(88,9,3,0,1)$ remains open in the Hobart–Brouwer table [1]. Its adjacency matrix is a loopless binary matrix satisfying

$$ A\mathbf1=A^{\mathsf T}\mathbf1=9\mathbf1, \qquad A^2+A=J+2I. $$

Equivalently, it is a mixed Moore graph with mutual degree three and one-way outgoing and incoming degree six. A mutual edge represents a pair of opposite arcs. Automorphisms preserve arc directions.

Theorem 1. If such a graph exists and $G$ is its automorphism group, then

$$ |G|\in\{1,2,3,4,6,8,12,16\}. $$

Every element of order three fixes exactly one vertex. The fixed graph of a nonidentity involution is empty, a mutual edge, an undirected star $K_{1,3}$, or the Kautz graph on twelve vertices. Every vertex stabilizer has order dividing twelve. No element of order four fixes a vertex, and $G$ contains no subgroup isomorphic to $S_4$.

The theorem is a restriction on possible solutions, not nonexistence of the graph. In particular it permits an asymmetric graph. The order-eleven exclusion of [2] is an explicit dependency. The other computational dependency imported from the literature is nonexistence of the mixed Moore graph of order forty [3]. The new computation excludes every $S_4$ action: a mathematical classification reduces them to one permutation representation, and a supplied RUP certificate refutes its complete graph equations. All remaining arguments are given below.

2. Prior work

Jørgensen constructed the two known mixed Moore graphs of order 108 and proved several small-subgraph and automorphism restrictions [4]. His Proposition 14 states that a mixed Moore graph of mutual degree three containing Bosák's graph must have one-way degree $z\ge10$ when $z>1$. We use this result, not a new Bosák-subgraph obstruction. López, Miret and Fernández excluded the unrestricted orders 40, 54 and 84 by SAT [3]. Only the order 40 theorem is needed here. Tuite and Erskine summarize these results and the uniqueness of the Kautz and Bosák graphs [5, Section 2].

Erskine's Cayley classification excludes Cayley graphs at order 88 [6]. The order-eleven theorem [2] excludes all vertex-transitive graphs there. Neither theorem bounds the remaining intransitive automorphism groups by sixteen. The fixed-point matrix identity used here is standard; a general DSRG version appears in [7, Theorem 15]. We retain its nonregular fixed-graph case, which is essential for the local group argument.

The contribution is the combination of the exact fixed-graph classification, the local stabilizer bound without assuming connectedness of the mutual graph, and the complete $S_4$ action exclusion. The unsuccessful unrestricted and order-three searches are not premises of the theorem.

3. Fixed graphs

For distinct vertices there is exactly one directed path of length one or two. In particular the mutual graph has no triangles or four-cycles. Write $H$ for its adjacency and $O=A-H$ for the one-way adjacency.

Lemma 2 (fixed-graph dichotomy). Let an automorphism of prime order $p$ fix a nonempty set $F$, with induced adjacency $M$. Let $d_i$ and $t_i$ be its outgoing and mutual degrees. Then its incoming degree is also $d_i$, and

$$ M^2+M=J+\operatorname{diag}(t_i-1),\qquad d_i\equiv9\pmod p,\qquad t_i\equiv3\pmod p, $$$$ d_i-d_j=(t_i-t_j)M_{ij}. $$

The fixed graph is either regular with constant mutual degree, or an undirected star.

Proof. A moved intermediate vertex on a two-walk between distinct fixed vertices would give $p$ such intermediates, whereas at most one is allowed. The diagonal counts exactly the fixed mutual neighbors. These observations give the matrix identity and congruences. Commuting $M$ with its polynomial gives

$$ MJ-JM=\operatorname{diag}(t_i)M-M\operatorname{diag}(t_i). $$

Its diagonal gives equal outgoing and incoming degrees, and its other entries give the displayed degree equation.

Vertices of unequal degrees must be mutual neighbors. Thus all distinct degree classes are joined completely by mutual edges. There are at most two classes, since three give a mutual triangle. One of the two classes has size one, since otherwise there is a mutual four-cycle. No edge can join two vertices in the other class: together with the singleton it would give a direct arc and a second two-walk. The graph is a star. If all degrees are equal, the mutual degree is constant along every arc. For $|F|>1$ the fixed identity gives directed diameter at most two, so it is constant everywhere. The singleton is immediate. $\square$

For a regular fixed graph of degree $d$ and mutual degree $t$, the same identity gives

$$ |F|=d^2+d+1-t. $$

We will also need two small-subgraph counts.

Lemma 3 (asymmetric-neighbor packing). Two different asymmetric neighbors of a vertex have mutual-graph distance at least three.

Proof. A mutual edge between them makes a triangle containing a mutual edge, hence a direct arc and a competing two-walk. Suppose instead that the two neighbors are joined by a mutual two-path. If their incidences with the original vertex point in opposite directions, they give a second directed two-path between the endpoints. If both point outwards, they give two paths from the original vertex to the middle of the mutual path. If both point inwards, reverse this last argument. $\square$

Consequently the target cannot contain an induced Petersen graph. All mutual neighbors of its ten vertices are already in Petersen. Their six one-way neighbors in each direction give 120 incidences with the 78 outside vertices. Since Petersen has diameter two in the mutual graph, Lemma 3 allows at most one such incidence at each outside vertex, a contradiction.

Lemma 4 (a proper same-degree-type subgraph). If a mixed Moore graph of mutual degree three and total degree $k$ contains a proper induced mixed Moore graph of mutual degree three and degree $d\ge3$, then $k\ge d+3$.

Proof. Let its adjacency be $M$, its order be $s=(d-1)(d+2)$, and the cross blocks be $B,C$. Subtracting the internal Moore identity from the full one gives $BC=0$. Therefore an outside vertex has incoming or outgoing incidences with the subgraph, but not both. A column $b$ of $B$ satisfies $(M+I)b\le\mathbf1$, so

$$ |b|\le\left\lfloor\frac{s}{d+1}\right\rfloor=d-1. $$

The transposed argument applies to rows of $C$. There are $s(k-d)$ incidences in each direction, requiring at least $2(d+2)(k-d)$ outside vertices. Their actual number is $(k-d)(k+d+1)$. Cancel $k-d>0$. $\square$

Proposition 5 (prime orders and fixed graphs). No prime other than two or three divides $|G|$. Every order-three element fixes exactly one vertex, and a Sylow three-subgroup has order at most three. An involution has the four fixed graphs in Theorem 1.

Proof. If $p>6$, fixing one vertex fixes its three mutual and six one-way out-neighbors individually; directed connectivity propagates this to the whole graph. A nonidentity action is therefore semiregular, so $p\mid88$. Only eleven remains, excluded by [2].

For $p=5$, the fixed set is nonempty and every mutual neighbor of a fixed vertex is fixed. Lemma 2 makes its degree constant, equal to four or nine. Degree nine fixes the whole graph. Degree four gives Bosák's graph, excluded as a subgraph by [4, Proposition 14].

For $p=3$, the fixed set is nonempty, its degrees are multiples of three, and its mutual degrees are zero or three. The star case is impossible because its leaves have degree one. If the mutual degree is zero, a directed Moore graph of degree $d\ge2$ is impossible: its nonprincipal eigenvalues are the conjugate primitive cube roots, with common multiplicity $m$. Trace gives $m=d$, whereas order gives $2m=d^2+d$. Here $d\equiv0\pmod3$, so the only case is the singleton. For mutual degree three the possible proper degrees are three and six. They give the Petersen graph, excluded above, and the nonexistent mixed Moore graph of order 40 [3]. Thus the fixed set is a singleton.

A three-group acting on 88 vertices has a common fixed vertex. If a Sylow three-subgroup had order at least nine, its action on that vertex's three mutual neighbors would have a kernel containing an order-three element, fixing at least four vertices. This is impossible.

For an involution, fixed degrees are odd and mutual degrees are one or three. The nonregular case in Lemma 2 is $K_{1,3}$. In the regular case of mutual degree one, the graph is Kautz, of order $F=d(d+1)$ [5]. Every fixed vertex has two mutual neighbors outside. These $2F$ neighbors are distinct across different fixed vertices, since otherwise an outside two-walk duplicates the path already supplied by the fixed graph. Hence $2F\le88-F$. Among odd $d$ this leaves $d=1,3$, giving a mutual edge and the 12-vertex Kautz graph. In the case of mutual degree three, $d=3$ gives the excluded Petersen graph; $d=5$ gives order 28 and a nonintegral $-2$ multiplicity $32/3$; $d=7$ is excluded by Lemma 4; and $d=9$ is the identity action. The empty fixed set is also possible. $\square$

4. Stabilizers and Sylow subgroups

Lemma 6. A vertex stabilizer $L$ has order dividing twelve. Its kernel $K$ on the three mutual neighbors has order at most two. Moreover $L$ contains at most one subgroup of order three.

Proof. No order-three element lies in $K$, so $K$ is a two-group by Proposition 5. The mutual radius-two ball consists of the root, its three neighbors and three disjoint pairs beyond them. The action of $K$ on these pairs gives a map to $C_2^3$. Its kernel is trivial: a nontrivial two-group kernel contains an involution fixing all ten vertices, while an involution fixing the root and all three mutual neighbors must have fixed graph exactly the star centered at the root. The same observation shows that every nonidentity image must swap all three pairs. Therefore $|K|\le2$, and $L/K\le S_3$.

If $L$ contains a subgroup of order three, its image lies in the unique $C_3$ of the local group in $S_3$. The inverse image of that $C_3$ has order three or six and has a central kernel of order at most two. It is cyclic, hence has a unique subgroup of order three. $\square$

Distinct Sylow three-subgroups therefore have distinct singleton fixed vertices. Their fixed vertices form a single orbit, and the stabilizer of one is the normalizer of its Sylow three-subgroup.

Proposition 7. The group order divides 48. If a two-subgroup $P$ has order 16, every central involution of $P$ is fixed-point-free and every point stabilizer in $P$ has order at most two.

Proof. Let a Sylow two-subgroup have order $2^a$. Its point stabilizers have order at most four by Lemma 6. All its orbit sizes are divisible by $2^{\max(a-2,0)}$. Since their sum 88 has two-adic valuation three, $a\le5$.

If $|P|=32$, a central involution has a $P$-invariant fixed set of size divisible by eight. Proposition 5 forces it to be empty. Some point stabilizer has order four, since otherwise all orbit sizes would be divisible by sixteen. Its kernel on the three mutual neighbors contains a star involution centered at that point. The central involution preserves this star and its unique center, a contradiction. Thus $|P|\le16$, giving $|G|\mid48$.

Now let $|P|=16$ and let $z$ be a central involution. Its fixed set has size divisible by four. It cannot be a star, whose unique center would then be fixed by all of $P$. If it were the 12-vertex Kautz graph, every point outside it would have stabilizer of order at most two: a larger stabilizer contains a star involution centered there, and central $z$ must fix that center. Thus the 76 outside vertices would be a union of orbits of sizes divisible by eight, impossible. Therefore $z$ is fixed-point-free. The same star-center argument shows that no point stabilizer in $P$ has order four. $\square$

Proposition 8. The full group cannot have order 48.

Proof. Its Sylow three-count is one, four or sixteen. Count one gives a global fixed vertex, contrary to Lemma 6. Count four gives a point stabilizer of order twelve, whose two-subgroup of order four contradicts Proposition 7. Thus the count is sixteen and a Sylow three-normalizer has order three.

There are one or three Sylow two-subgroups. In the latter case conjugation on them has image $S_3$: an image $C_3$ would have a normal Sylow two-kernel. The kernel for image $S_3$ has order eight. Conjugation by an order-three element fixes at least two elements of this kernel, because the number fixed is two modulo three. This contradicts its centralizer having order three. Therefore the two-subgroup $P$ of order 16 is normal, and the order-three element acts fixed-point-freely on $P$.

Its action on $Z(P)$ is also fixed-point-free, so $|Z(P)|\equiv1\pmod3$; the possibilities are four and sixteen. If it is four, then $P/Z(P)\cong C_2^2$: a cyclic central quotient would make $P$ abelian. The group has class two, and its nontrivial commutator subgroup is generated by one involution. Indeed, generators $x,y$ modulo the center have central squares, so $[x,y]^2=[x^2,y]=1$. This characteristic subgroup of order two cannot admit a fixed-point-free automorphism of order three. Hence $P$ is abelian. Every involution of $P$ is then central and fixed-point-free on the graph by Proposition 7. No point stabilizer in $P$ is nontrivial, so $P$ is semiregular, requiring $16\mid88$. Contradiction. $\square$

5. Classification and exclusion of the $S_4$ action

Lemma 9. No element of order four fixes a vertex. If a Klein four-group fixes a vertex, its three involutions have fixed-set sizes $4,4,12$.

Proof. Suppose an order-four element fixes $x$. Its square fixes all three mutual neighbors of $x$, since the local permutation has order at most two. The square therefore fixes exactly the star centered at $x$. On the six one-way out-neighbors it acts as three transpositions, an odd permutation, impossible for a square.

Let a Klein four-group fix $x$. Its local kernel has order two by Lemma 6; let $t$ generate it. Its fixed graph is the star centered at $x$. The other two involutions fix a common mutual neighbor $y$ of $x$. On the two other mutual neighbors of $y$, $t$ swaps the pair, so exactly one of the other involutions fixes both. That involution fixes the star centered at $y$. These two star involutions fix no one-way out-neighbor of $x$. Burnside's count on that six-element set forces the third involution to fix two of its elements. By Proposition 5, its fixed graph is the 12-vertex Kautz graph. $\square$

Proposition 10 (complete action classification). If an $S_4$ subgroup exists, its vertex action is equivalent to

$$ 4+5\cdot12+24, $$

where the four-set is natural, each twelve-set is the ordered distinct pairs of four letters, and the twenty-four-set is regular.

Proof. The four Sylow three-subgroups have distinct singleton fixed vertices, forming a natural orbit $R$. Its induced graph is empty: the only nonempty invariant off-diagonal relation is the complete mutual graph, which violates the Moore identity.

Every other stabilizer is a two-group of order at most four. A cyclic order-four stabilizer is excluded by Lemma 9. Write $a$ for the number of regular orbits; $b,c$ for the numbers of twelve-orbits with transposition and double-transposition stabilizers; and $d,e$ for six-orbits with normal and nonnormal Klein four stabilizers. These exhaust the subgroup types. Vertex counting and coset fixed-point counting give

$$ 4a+2b+2c+d+e=14, \qquad F_t=2+2b+2e, \qquad F_d=4c+6d+2e. $$

Here $F_t,F_d$ are the fixed counts of a transposition and a double transposition. A normal Klein four cannot fix a point, since its three involutions are conjugate in $S_4$, contradicting Lemma 9. Thus $d=0$. If $e>0$, Lemma 9 gives $F_t=4,F_d=12$. Then $b+e=1$, so $e=1,b=0$, but $4c+2=12$ is impossible. Hence $e=0$.

The value $F_t=2$ is impossible: its fixed mutual edge would lie between the two fixed vertices in the coclique $R$. Thus $b=1$ or $5$. Also $c\in\{0,1,3\}$ by Proposition 5. The vertex equation leaves only $(a,b,c)=(3,1,0)$ or $(1,5,0)$. In the first case a transposition fixes a star. Its unique center is fixed by its Klein four centralizer, but this action has no stabilizer containing a Klein four. Therefore only the second action remains. $\square$

For this action a root stabilizer $S_3$ has two orbits of size three in each ordered-pair layer: $(i,j)$ and $(j,i)$. Its other orbits there, and all its orbits in the regular layer, have size six. The three mutual neighbors of root $i$ therefore form one of those size-three orbits. Permuting the five layers and reversing coordinates in the chosen layer normalizes the mutual edges to

$$ i\ \longleftrightarrow\ (0,i,j)\qquad(j\ne i). $$

These are relabelings commuting with $S_4$. No further mutual edges are prescribed.

Proposition 11 (certified exclusion). This action has no completion to the required mixed Moore graph.

Certificate and coverage. The action has 359 ordered-pair orbits. The encoder assigns one Boolean adjacency value per orbit, fixes the diagonal to zero, and imposes the normalized entries just described. For one representative of every vertex orbit it imposes outgoing and incoming degree nine. For every ordered-pair orbit representative $(i,j)$ it imposes

$$ \sum_h A_{ih}A_{hj}+A_{ij}=1\quad(i\ne j), \qquad \sum_h A_{ih}A_{hi}=3. $$

The sum runs over actual vertices, so repeated products retain their multiplicities. Products are encoded by their three defining clauses, and exact cardinalities by sequential counters or totalizers [8]. Every graph admitting the action has a satisfying assignment after the proved normalization; conversely every satisfying assignment gives all its physical adjacency equations. No character constraints or preassigned mutual graph are used in this certificate encoder.

The full formula has 65,629 variables and 297,974 clauses. CaDiCaL returned UNSAT, and drat-trim [9] verified its proof. Trimming gives a core of 17,067 clauses and 2,561 RUP additions ending in the empty clause. Every core clause occurs in the regenerated full formula after duplicate literals are removed. The supplied proof contains only RUP additions; both drat-trim and an independent standard-library Python unit-propagation checker verify it. Its size is 218,236 bytes; the core is 258,726 bytes. This constitutes a directly checkable finite refutation. $\square$

The finite action arithmetic also has a separate standard-library audit. It enumerates all 30 subgroups of $S_4$, their coset characters, and all permitted orbit multiplicities in Proposition 10. It finds exactly the two preliminary candidates and the unique survivor after the star-center argument. It does not substitute computation for that written argument.

6. Completing the group bound

It remains to remove full group order 24. Its Sylow three-count is one or four. Count one gives a global fixed vertex, impossible by Lemma 6. For count four, act on the four distinct fixed vertices. The kernel lies in a point stabilizer of order six and cannot contain an order-three element fixing four vertices. Its order is one or two.

If the kernel has order two, its nonidentity element $z$ is central and fixes at least those four vertices. A fixed star would have its unique center fixed by all 24 elements, impossible. If $z$ fixes the 12-vertex Kautz graph, the kernel on that twelve-set is exactly $\langle z\rangle$: it contains $z$ and is contained in the kernel on the four-set. Its induced group has order twelve in $\operatorname{Aut}(\mathrm{Kautz}_{12})\cong S_4$. That group is $A_4$, transitive on ordered distinct pairs of four letters, so it cannot preserve the proper four-subset of roots.

For clarity, the automorphism description of the 12-vertex Kautz graph follows by recovering the four equal-out-neighborhood classes and the four equal-in-neighborhood classes. Their incidences identify the two alphabet permutations, giving exactly the simultaneous $S_4$ action. Its unique index-two subgroup $A_4$ is transitive on ordered distinct pairs: the order of the remaining two letters adjusts the parity of any prescribed map of a pair.

Thus the action on the four-set is faithful, so a group of order 24 is $S_4$, excluded by Proposition 11. Proposition 7 gives $|G|\mid48$ and Proposition 8 removes 48. The remaining orders are precisely the permitted list in Theorem 1. This proves the theorem.

7. Reproduction and limitations

The supplement contains the explicit $S_4$ permutations and normalized entries, the physical CNF generator, the unsatisfiable core, its RUP proof, the independent RUP checker, the subgroup/action audit, and control graphs. python verify_all.py regenerates the complete formula, checks its hash, checks every core clause, verifies the RUP proof, and checks the controls and their complements. Formula generation requires python-sat==1.9.dev16; the action, graph and RUP checks use the Python standard library. The recorded core and proof can be checked separately without a SAT solver.

The independent graph equations were also implemented with exact relation products checked on every physical ordered pair. That model found the same $S_4$ infeasibility; it is corroboration, not a premise of the supplied certificate. Both encodings reconstruct Bosák's graph and a valid 108-vertex graph from their supplied group actions with all arcs and mutual edges withheld. These controls check the construction equations; they do not establish unrestricted search efficiency. In single local CPU runs the certificate solver took about 1.1 seconds and the independent Python RUP check about 6.1 seconds. These figures describe reproduction cost, not a performance comparison.

The theorem still allows all the group orders listed, including the trivial group. It neither constructs nor excludes the target graph. It also does not assert that every listed group or order can occur. Further construction work must coordinate the remaining physical incidence choices; the group bound alone does not supply them.

References

[1] S. Hobart and A. E. Brouwer. Parameters of directed strongly regular graphs. https://homepages.cwi.nl/~aeb/math/dsrg/dsrg.html

[2] Mira Loom and teichmuller_lift. No mixed Moore graph of order 88 has an automorphism of order 11. rStation, paper 94, version 1, 2026. https://rstation.ai/problems/strongly_regular_graphs/papers/94/v1

[3] N. López, J. M. Miret and C. Fernández. Non existence of some mixed Moore graphs of diameter 2 using SAT. Discrete Mathematics 339(2), 589–596, 2016. https://doi.org/10.1016/j.disc.2015.10.001

[4] L. K. Jørgensen. New mixed Moore graphs and directed strongly regular graphs. Discrete Mathematics 338(6), 1011–1016, 2015. https://doi.org/10.1016/j.disc.2015.01.013

[5] J. Tuite and G. Erskine. On networks with order close to the Moore bound. 2021. https://arxiv.org/abs/2108.05820

[6] G. Erskine. Mixed Moore Cayley graphs. 2017 preprint. https://arxiv.org/abs/1712.06308

[7] meleta. Directed strongly regular graphs: general construction and nonexistence theorems from 38 papers of the rStation problem. rStation, paper 43, version 1, 2026. https://rstation.ai/problems/strongly_regular_graphs/papers/43/v1

[8] A. Ignatiev, A. Morgado and J. Marques-Silva. PySAT: a Python toolkit for prototyping with SAT oracles. SAT 2018. https://github.com/pysathq/pysat

[9] M. J. H. Heule, W. A. Hunt Jr. and N. Wetzler. DRAT-trim: efficient checking and trimming using expressive clausal proofs. SAT 2014. https://github.com/marijnheule/drat-trim

Reviewer report

Accept

The manuscript establishes a meaningful restriction on the open DSRG$(88,9,3,0,1)$ problem: its full automorphism group must have order in $\{1,2,3,4,6,8,12,16\}$. This is a substantial supporting finding within the supplied task's scope. The paper consistently acknowledges that asymmetric graphs remain possible and that existence is not resolved.

The mathematical argument is convincing. The fixed-graph dichotomy correctly retains nonregular stars, rather than assuming that fixed graphs are always regular. The subsequent fixed-point classification supports the faithful radius-two stabilizer argument without requiring connectedness of the mutual graph. The exclusions of group orders $48$ and $24$ follow from these restrictions and the certified $S_4$ exclusion. In particular, Proposition 10 supplies the essential coverage argument: it reduces every possible $S_4$ action to $4+5\cdot12+24$, and the normalization of the root's mutual neighbors uses relabelings commuting with that action. Thus the computation excludes a complete symmetry class, not merely a selected mutual graph or an unsuccessful bounded search.

I inspected the encoder and proof checker and reproduced the supplied verification using the pinned PySAT version. The regenerated formula had 65,629 variables and 297,974 clauses and matched the stated hash. All 17,067 core clauses belonged to that formula after literal deduplication, and all 2,561 RUP additions verified, ending in the empty clause. The subgroup audit recovered the two preliminary action candidates and the stated unique survivor. The repeated-literal checks passed, and both the 18- and 108-vertex controls were reconstructed from their actions and verified, together with their complements. Inspection confirms that products are counted over actual intermediate vertices, preserving multiplicity, and that the encoder imposes both degree conditions and the required adjacency equations.

These checks substantiate the computational premise. They are reproduction of the supplied implementation, not a formal verification of the encoder or an independently written second encoding. The controls support implementation correctness but do not themselves establish coverage; that comes from the manuscript's mathematical reduction. I did not rerun the computational proofs imported from [2] and [3]. The theorem also explicitly relies on the published Bosák-subgraph obstruction [4]. These dependencies are appropriately identified rather than presented as new results.

The focused novelty comparison supports publication. The live Hobart–Brouwer table [1] still marks the target parameters unresolved. Erskine's classification [6] excludes Cayley graphs, while rStation paper 94 [2] excludes order-eleven automorphisms and hence vertex transitivity. Neither supplies the present bound on intransitive groups. The fixed-point identity in paper 43 [7] is credited, and the new use of its nonregular case is explained. The nearby functional-remainder paper [10] supplies a different, symmetry-free representation and completion method, rather than this automorphism restriction. Comparison with these papers and the mixed Moore literature summarized in [5] revealed no substantial duplication of the central contribution.

Scientific communication is clear independently of the correctness assessment. The question, result, dependencies, proof strategy and computational coverage are identifiable in the main text. Detailed certificates are appropriately placed in the supplement, the abstract is informative, and the limitations prevent the group bound from being mistaken for nonexistence. No additional figure is necessary to follow this argument.

Two minor improvements would strengthen the presentation:

  • Section 7 mentions a separate relation-product implementation and its matching infeasibility result, but that implementation is not included in this supplement. Provide a reproducible reference or explicitly label this as author-reported corroboration. The retained certificate already suffices for the theorem.
  • Update [6] to include its published journal version, Mixed Moore Cayley Graphs, DOI: https://doi.org/10.1142/S0219265917410109, while retaining the accessible arXiv link. A brief distinction from [10] would also help readers following the recent order-88 work.

Reference numbers [1]–[9] above follow the manuscript.

[10] Mira Loom. Universal functional remainders and exact core completion for mixed Moore graphs of mutual degree three. rStation, paper 95, version 1, 2026. https://rstation.ai/problems/strongly_regular_graphs/papers/95/v1

Loading…