Terry S. Griggs
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Terry S. Griggs has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Grahame Erskine
Open University, United Kingdom
9 shared publications - Anthony D. Forbes
LSBU Business School London South Bank University London UK
5 shared publications - Diane Donovan
University of Queensland
3 shared publications - Jozef Širáň
Open University Milton Keynes UK
3 shared publications - Aleš Drápal
Department of Mathematics, Charles University, Sokolovská 83, 186 75 Praha 8, Czech Republic
2 shared publications - Andrew Richard Kozlik
Department of Algebra, Charles University, Sokolovská 83, 186 75 Praha 8, Czech Republic
2 shared publications
Latest Publications
- Open Access
- 12 September 2025
- Published by University of Primorska Press in Ars Mathematica Contemporanea
Mutually avoiding Eulerian circuits
AMC is a journal published by University of Primorska.
- 12 September 2025
- Published by University of Primorska Press in Ars Mathematica Contemporanea
Open AccessMutually avoiding Eulerian circuits
AMC is a journal published by University of Primorska.
- 15 July 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (11)
Properties of Steiner triple systems of order 21
- 15 July 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (11)
Properties of Steiner triple systems of order 21
- 1 July 2024
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 108 (572) , 336-338
108.30 Nearly isosceles right-angled triangles and square triangular numbers
108.30 Nearly isosceles right-angled triangles and square triangular numbers - Volume 108 Issue 572
- 1 July 2024
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 108 (572) , 336-338
108.30 Nearly isosceles right-angled triangles and square triangular numbers
108.30 Nearly isosceles right-angled triangles and square triangular numbers - Volume 108 Issue 572
- Open Access
Cycle switching in Steiner triple systems of order 19
Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order $v$ (an $STS(v)$), yielding another $STS(v)$. This relationship may be represented by an undirected graph. An $STS(v)$ admits cycles of lengths $4,6,\ldots,v-7$ and $v-3$. In the particular case of $v=19$, it is known that the full switching graph, allowing switching of cycles of any length, is connected. We show that if we restrict switching to only one of the possible cycle lengths, in all cases the switching graph is disconnected (even if we ignore those $STS(19)$s which have no cycle of the given length). Moreover, in a number of cases we find intriguing connected components in the switching graphs which exhibit unexpected symmetries. Our method utilises an algorithm for determining connected components in a very large implicitly defined graph which is more efficient than previous approaches, avoiding the necessity of computing canonical labellings for a large proportion of the systems.Open AccessCycle switching in Steiner triple systems of order 19
Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order $v$ (an $STS(v)$), yielding another $STS(v)$. This relationship may be represented by an undirected graph. An $STS(v)$ admits cycles of lengths $4,6,\ldots,v-7$ and $v-3$. In the particular case of $v=19$, it is known that the full switching graph, allowing switching of cycles of any length, is connected. We show that if we restrict switching to only one of the possible cycle lengths, in all cases the switching graph is disconnected (even if we ignore those $STS(19)$s which have no cycle of the given length). Moreover, in a number of cases we find intriguing connected components in the switching graphs which exhibit unexpected symmetries. Our method utilises an algorithm for determining connected components in a very large implicitly defined graph which is more efficient than previous approaches, avoiding the necessity of computing canonical labellings for a large proportion of the systems. - Open Access
Properties of Steiner triple systems of order 21
Properties of the 62,336,617 Steiner triple systems of order 21 with a non-trivial automorphism group are examined. In particular, there are 28 which have no parallel class, six that are 4-chromatic, five that are 3-balanced, 20 that avoid the mitre, 21 that avoid the crown, one that avoids the hexagon and two that avoid the prism. All systems contain the grid. None have a block intersection graph that is 3-existentially closed.
Open AccessProperties of Steiner triple systems of order 21
Properties of the 62,336,617 Steiner triple systems of order 21 with a non-trivial automorphism group are examined. In particular, there are 28 which have no parallel class, six that are 4-chromatic, five that are 3-balanced, 20 that avoid the mitre, 21 that avoid the crown, one that avoids the hexagon and two that avoid the prism. All systems contain the grid. None have a block intersection graph that is 3-existentially closed.
- Open Access
Mutually avoiding Eulerian circuits
Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which admits two such avoiding circuits starting from any vertex is said to be doubly Eulerian. The motivation for this definition is that the extremal Eulerian graphs, i.e. the complete graphs on an odd number of vertices and the cycles, are not doubly Eulerian. We prove results about doubly Eulerian graphs and identify those that are the `densest' and `sparsest' in terms of the number of edges.
Open AccessMutually avoiding Eulerian circuits
Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which admits two such avoiding circuits starting from any vertex is said to be doubly Eulerian. The motivation for this definition is that the extremal Eulerian graphs, i.e. the complete graphs on an odd number of vertices and the cycles, are not doubly Eulerian. We prove results about doubly Eulerian graphs and identify those that are the `densest' and `sparsest' in terms of the number of edges.
- Open Access
- 29 December 2022
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 17 (2) , 112-136
Designs for graphs with six vertices and ten edges - II
The design spectrum has been determined for ten of the 15 graphs with six vertices and ten edges. In this paper, we solve the design spectrum problem for the remaining five graphs with three possible exceptions.
- 29 December 2022
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 17 (2) , 112-136
Open AccessDesigns for graphs with six vertices and ten edges - II
The design spectrum has been determined for ten of the 15 graphs with six vertices and ten edges. In this paper, we solve the design spectrum problem for the remaining five graphs with three possible exceptions.
- Open Access
Good point sequencings of Steiner triple systems
An l-good sequencing of a Steiner triple system of order v, STS(v), is a permutation of the points of the system such that no l consecutive points in the permutation contains a block. It is known that every STS(v) with v > 3 has a 3-good sequencing. It is proved that every STS(v) with v >= 13 has a 4-good sequencing and every 3-chromatic STS(v) with v >= 15 has a 5-good sequencing. Computational results for Steiner triple systems of small order are also given.
Open AccessGood point sequencings of Steiner triple systems
An l-good sequencing of a Steiner triple system of order v, STS(v), is a permutation of the points of the system such that no l consecutive points in the permutation contains a block. It is known that every STS(v) with v > 3 has a 3-good sequencing. It is proved that every STS(v) with v >= 13 has a 4-good sequencing and every 3-chromatic STS(v) with v >= 15 has a 5-good sequencing. Computational results for Steiner triple systems of small order are also given.
- Open Access
Clique-partitioned graphs
A graph $G$ of order $nv$ where $n\geq 2$ and $v\geq 2$ is said to be weakly $(n,v)$-clique-partitioned if its vertex set can be decomposed in a unique way into $n$ vertex-disjoint $v$-cliques. It is strongly $(n,v)$-clique-partitioned if in addition, the only $v$-cliques of $G$ are the $n$ cliques in the decomposition. We determine the structure of such graphs which have the largest possible number of edges.Open AccessClique-partitioned graphs
A graph $G$ of order $nv$ where $n\geq 2$ and $v\geq 2$ is said to be weakly $(n,v)$-clique-partitioned if its vertex set can be decomposed in a unique way into $n$ vertex-disjoint $v$-cliques. It is strongly $(n,v)$-clique-partitioned if in addition, the only $v$-cliques of $G$ are the $n$ cliques in the decomposition. We determine the structure of such graphs which have the largest possible number of edges. - Open Access
- 24 February 2022
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 32 (04) , 683-715
Quadratical quasigroups and Mendelsohn designs
- 24 February 2022
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 32 (04) , 683-715
Open AccessQuadratical quasigroups and Mendelsohn designs