Anthony D. Forbes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Anthony D. Forbes has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Terry S. Griggs
The Open University
6 shared publications - Carrie G. Rutherford
LSBU Business School London South Bank University London UK
5 shared publications - Terry S. Griggs
School of Mathematics and Statistics The Open University Walton Hall Milton MK7 6AA Keynes United Kingdom
5 shared publications - Michael J. Grannell
School of Mathematics and Statistics, The Open University, Milton Keynes, UK
4 shared publications K. A. Forbes
Research, Business and Innovation, Kingston University, Penrhyn Road, Kingston upon Thames, KT1 2EE, UK
2 shared publicationsM.J. Grannell
Department of Pure Mathematics, The Open University, Walton Hall, Milton Keynes MK7 6AA, United Kingdom
2 shared publications
Latest Publications
- 3 July 2025
- Published by Wiley in Journal of Combinatorial Designs
A Construction for Regular‐Graph Designs
A regular‐graph design is a block design for which a pair of distinct points occurs in or blocks depending on whether is or is not an edge of a given ‐regular graph. Our paper describes a specific construction for regular‐graph designs with and block size . We show that for , certain necessary conditions for the existence of such a design with points are sufficient, with two exceptions in each case and two possible exceptions when . We also construct designs of orders 105 and 117 for connected 4‐regular graphs.
- 3 July 2025
- Published by Wiley in Journal of Combinatorial Designs
A Construction for Regular‐Graph Designs
A regular‐graph design is a block design for which a pair of distinct points occurs in or blocks depending on whether is or is not an edge of a given ‐regular graph. Our paper describes a specific construction for regular‐graph designs with and block size . We show that for , certain necessary conditions for the existence of such a design with points are sufficient, with two exceptions in each case and two possible exceptions when . We also construct designs of orders 105 and 117 for connected 4‐regular graphs.
- 19 June 2024
- Published by Springer Nature in La Matematica
- Vol. 3 (3) , 965-993
Generalized Pentagonal Geometries-II
- 19 June 2024
- Published by Springer Nature in La Matematica
- Vol. 3 (3) , 965-993
Generalized Pentagonal Geometries-II
- Open Access
Design spectra for 6-regular graphs with 12 vertices
The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. We compute the design spectra for 7788 6-regular graphs with 12 vertices.Open AccessDesign spectra for 6-regular graphs with 12 vertices
The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. We compute the design spectra for 7788 6-regular graphs with 12 vertices. - Open Access
Group divisible designs with block size five: direct constructions
We give direct constructions for 233 group divisible designs with block size five, mostly of type $g^u m^1$, $m > 0$.Open AccessGroup divisible designs with block size five: direct constructions
We give direct constructions for 233 group divisible designs with block size five, mostly of type $g^u m^1$, $m > 0$. - Open Access
Generalized pentagonal geometries -- II
A generalized pentagonal geometry PENT($k$,$r$,$w$) is a partial linear space, where every line is incident with $k$ points, every point is incident with $r$ lines, and for each point, $x$, the set of points not collinear with $x$ forms the point set of a Steiner system $S(2,k,w)$ whose blocks are lines of the geometry. If $w = k$, the structure is called a pentagonal geometry and denoted by PENT($k$,$r$). The deficiency graph of a PENT($k$,$r$,$w$) has as its vertices the points of the geometry, and there is an edge between $x$ and $y$ precisely when $x$ and $y$ are not collinear. Our primary objective is to investigate generalized pentagonal geometries PENT($k$,$r$,$w$) where the deficiency graph has girth 4. We describe some construction methods, including a procedure that preserves deficiency graph connectedness, and we prove a number of theorems regarding the existence spectra for $k = 3$ and various values of $w$. In addition, we present some new PENT(4,$r$) (including PENT(4,25)) and PENT(5,$r$) with connected deficiency graphs. Consequently, we prove that there exist pentagonal geometries PENT($k$,$r$) with deficiency graphs of girth at least 5 for $r \ge 13$, $r$ congruent to 1 modulo 4 when $k = 4$, and for $r \ge 200000$, $r$ congruent to 0 or 1 modulo 5 when $k = 5$. We conclude with a discussion of appropriately defined identifying codes for pentagonal geometries.Open AccessGeneralized pentagonal geometries -- II
A generalized pentagonal geometry PENT($k$,$r$,$w$) is a partial linear space, where every line is incident with $k$ points, every point is incident with $r$ lines, and for each point, $x$, the set of points not collinear with $x$ forms the point set of a Steiner system $S(2,k,w)$ whose blocks are lines of the geometry. If $w = k$, the structure is called a pentagonal geometry and denoted by PENT($k$,$r$). The deficiency graph of a PENT($k$,$r$,$w$) has as its vertices the points of the geometry, and there is an edge between $x$ and $y$ precisely when $x$ and $y$ are not collinear. Our primary objective is to investigate generalized pentagonal geometries PENT($k$,$r$,$w$) where the deficiency graph has girth 4. We describe some construction methods, including a procedure that preserves deficiency graph connectedness, and we prove a number of theorems regarding the existence spectra for $k = 3$ and various values of $w$. In addition, we present some new PENT(4,$r$) (including PENT(4,25)) and PENT(5,$r$) with connected deficiency graphs. Consequently, we prove that there exist pentagonal geometries PENT($k$,$r$) with deficiency graphs of girth at least 5 for $r \ge 13$, $r$ congruent to 1 modulo 4 when $k = 4$, and for $r \ge 200000$, $r$ congruent to 0 or 1 modulo 5 when $k = 5$. We conclude with a discussion of appropriately defined identifying codes for pentagonal geometries. - 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
Group divisible designs with block size five
We report some group divisible designs with block size five, including types $6^{15}$ and $10^{15}$. As a consequence we are able to extend the known spectrum for 5-GDDs of type $g^u$.Open AccessGroup divisible designs with block size five
We report some group divisible designs with block size five, including types $6^{15}$ and $10^{15}$. As a consequence we are able to extend the known spectrum for 5-GDDs of type $g^u$. - 31 October 2021
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 30 (1) , 48-70
Generalized pentagonal geometries
- 31 October 2021
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 30 (1) , 48-70
Generalized pentagonal geometries
- Open Access
Generalized pentagonal geometries
A pentagonal geometry PENT($k$, $r$) is a partial linear space, where every line is incident with $k$ points, every point is incident with $r$ lines, and for each point $x$, there is a line incident with precisely those points that are not collinear with $x$. Here we generalize the concept by allowing the points not collinear with $x$ to form the point set of a Steiner system $S(2,k,w)$ whose blocks are lines of the geometry.Open AccessGeneralized pentagonal geometries
A pentagonal geometry PENT($k$, $r$) is a partial linear space, where every line is incident with $k$ points, every point is incident with $r$ lines, and for each point $x$, there is a line incident with precisely those points that are not collinear with $x$. Here we generalize the concept by allowing the points not collinear with $x$ to form the point set of a Steiner system $S(2,k,w)$ whose blocks are lines of the geometry. - 11 January 2021
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 29 (5) , 307-330
Pentagonal geometries with block sizes 3, 4, and 5
- 11 January 2021
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 29 (5) , 307-330
Pentagonal geometries with block sizes 3, 4, and 5