Thomas Britz
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
Research Interests
Thomas Britz has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
- R. Julian. R. Abel
School of Mathematics and Statistics, UNSW Sydney New South Wales Australia
8 shared publications - Yudhistira A. Bunjamin
School of Mathematics and Statistics UNSW Sydney 2052 NSW Australia
8 shared publications - Diana Combe
School of Mathematics and Statistics UNSW Sydney 2052 NSW Australia
7 shared publications - Keisuke Shiromoto
Kumamoto University
5 shared publications - Hopein Christofen Tang
School of Mathematics and Statistics, UNSW Sydney, Sydney, NSW, Australia
3 shared publications - Nero Ziyu Li
Department of Mathematics, Imperial College London, London, United Kingdom
3 shared publications
Latest Publications
- Open Access
- 10 April 2026
- Published by IOP Publishing in Nonlinearity
- Vol. 39 (4) , 045009
Reducible Iterated Graph Systems: multiscale-freeness and multifractals
Iterated graph systems (IGS) transplant ideas from fractal geometry into graph theory. Building on this framework, we extend Edge IGS from the primitive to the reducible setting. Within this broader context, we formulate rigorous definitions of multifractality and multiscale-freeness for fractal graphs, and we establish conditions that are equivalent to the occurrence of these two phenomena. We further determine the corresponding fractal and degree spectra, proving that both are finite and discrete. These results complete the foundational theory of Edge IGS by filling the gap left by the primitive case studied in Li et al and Neroli (2024 Proc. Am. Math. Soc. 152 1377–89; 2024 Proc. R. Soc. A 480 20240406)
- 10 April 2026
- Published by IOP Publishing in Nonlinearity
- Vol. 39 (4) , 045009
Open AccessReducible Iterated Graph Systems: multiscale-freeness and multifractals
Iterated graph systems (IGS) transplant ideas from fractal geometry into graph theory. Building on this framework, we extend Edge IGS from the primitive to the reducible setting. Within this broader context, we formulate rigorous definitions of multifractality and multiscale-freeness for fractal graphs, and we establish conditions that are equivalent to the occurrence of these two phenomena. We further determine the corresponding fractal and degree spectra, proving that both are finite and discrete. These results complete the foundational theory of Edge IGS by filling the gap left by the primitive case studied in Li et al and Neroli (2024 Proc. Am. Math. Soc. 152 1377–89; 2024 Proc. R. Soc. A 480 20240406)
- Open Access
- 30 June 2025
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 48 (4) , 1-15
Bounds on the Closeness Centrality of a Graph
We present new values and bounds on the (normalised) closeness centrality $$\bar{\textsf{C}}_C$$ of connected graphs and on its product $$\bar{l}\bar{\textsf{C}}_C$$ with the mean distance $$\bar{l}$$ of these graphs. Our main result presents the fundamental bounds $$1\le \bar{l}\bar{\textsf{C}}_C<2$$ . We prove that the lower bound is tight and that the upper bound is asymptotically tight. Combining the lower bound with known upper bounds on the mean distance, we find ten new lower bounds for the closeness centrality of graphs. We also present explicit expressions for $$\bar{\textsf{C}}_C$$ and $$\bar{l}\bar{\textsf{C}}_C$$ for specific families of graphs. Elegantly and perhaps surprisingly, the asymptotic values of $$n\bar{\textsf{C}}_C$$ for paths $$P_n$$ and ladder graphs $$L_n$$ are both equal to $$\pi $$ , and the asymptotic limits of $$\bar{l}\bar{\textsf{C}}_C$$ for these families of graphs are both equal to $$\pi /3$$ . We conjecture that the set of values $$\bar{l}\bar{\textsf{C}}_C$$ for all connected graphs is dense in the interval [1, 2).- 30 June 2025
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 48 (4) , 1-15
Open AccessBounds on the Closeness Centrality of a Graph
We present new values and bounds on the (normalised) closeness centrality $$\bar{\textsf{C}}_C$$ of connected graphs and on its product $$\bar{l}\bar{\textsf{C}}_C$$ with the mean distance $$\bar{l}$$ of these graphs. Our main result presents the fundamental bounds $$1\le \bar{l}\bar{\textsf{C}}_C<2$$ . We prove that the lower bound is tight and that the upper bound is asymptotically tight. Combining the lower bound with known upper bounds on the mean distance, we find ten new lower bounds for the closeness centrality of graphs. We also present explicit expressions for $$\bar{\textsf{C}}_C$$ and $$\bar{l}\bar{\textsf{C}}_C$$ for specific families of graphs. Elegantly and perhaps surprisingly, the asymptotic values of $$n\bar{\textsf{C}}_C$$ for paths $$P_n$$ and ladder graphs $$L_n$$ are both equal to $$\pi $$ , and the asymptotic limits of $$\bar{l}\bar{\textsf{C}}_C$$ for these families of graphs are both equal to $$\pi /3$$ . We conjecture that the set of values $$\bar{l}\bar{\textsf{C}}_C$$ for all connected graphs is dense in the interval [1, 2). - Open Access
- 19 September 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (2)
Group divisible designs with block size 4 and group sizes 4 and 10 and some other 4-GDDs
- 19 September 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (2)
Open AccessGroup divisible designs with block size 4 and group sizes 4 and 10 and some other 4-GDDs
- Open Access
- 26 June 2024
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 47 (4) , 1-44
The Ramsey Numbers for Trees of Large Maximum Degree Versus the Wheel Graph $W_8$The Ramsey numbers $$R(T_n,W_8)$$ are determined for each tree graph $$T_n$$ of order $$n\ge 7$$ and maximum degree $$\Delta (T_n)$$ equal to either $$n-4$$ or $$n-5$$ . These numbers indicate strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $$R(T_n,W_m) = 2n-1$$ for each tree graph $$T_n$$ of order $$n\ge m-1$$ with $$\Delta (T_n)\le n-m+2$$ when $$m\ge 4$$ is even.- 26 June 2024
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 47 (4) , 1-44
Open AccessThe Ramsey Numbers for Trees of Large Maximum Degree Versus the Wheel Graph $W_8$The Ramsey numbers $$R(T_n,W_8)$$ are determined for each tree graph $$T_n$$ of order $$n\ge 7$$ and maximum degree $$\Delta (T_n)$$ equal to either $$n-4$$ or $$n-5$$ . These numbers indicate strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $$R(T_n,W_m) = 2n-1$$ for each tree graph $$T_n$$ of order $$n\ge m-1$$ with $$\Delta (T_n)\le n-m+2$$ when $$m\ge 4$$ is even. - Open Access
- 28 March 2024
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 32 (6) , 328-346
Group divisible designs with block size 4 and group sizes 4 and 7
In this paper, we consider the existence of group divisible designs (GDDs) with block size and group sizes and . We show that there exists a ‐GDD of type for all but a finite specified set of feasible values for .
- 28 March 2024
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 32 (6) , 328-346
Open AccessGroup divisible designs with block size 4 and group sizes 4 and 7
In this paper, we consider the existence of group divisible designs (GDDs) with block size and group sizes and . We show that there exists a ‐GDD of type for all but a finite specified set of feasible values for .
- Open AccessThe Ramsey numbers for trees of order $n$ with maximum degree at least $n-5$ versus the wheel graph of order nineThe Ramsey numbers $R(T_n,W_8)$ are determined for each tree graph $T_n$ of order $n\geq 7$ and maximum degree $Δ(T_n)$ equal to either $n-4$ or $n-5$. These numbers indicate strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $R(T_n,W_m) = 2n-1$ for each tree graph $T_n$ of order $n\geq m-1$ with $Δ(T_n)\leq n-m+2$ when $m\geq 4$ is even.Open AccessThe Ramsey numbers for trees of order $n$ with maximum degree at least $n-5$ versus the wheel graph of order nineThe Ramsey numbers $R(T_n,W_8)$ are determined for each tree graph $T_n$ of order $n\geq 7$ and maximum degree $Δ(T_n)$ equal to either $n-4$ or $n-5$. These numbers indicate strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $R(T_n,W_m) = 2n-1$ for each tree graph $T_n$ of order $n\geq m-1$ with $Δ(T_n)\leq n-m+2$ when $m\geq 4$ is even.
- 9 February 2024
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 152 (4) , 1377-1389
On the scale-freeness of random colored substitution networks
Extending previous results in the literature, random colored substitution networks and degree dimension are defined in this paper. The scale-freeness of these networks is proved by introducing a new definition for degree dimension that is associated with Lyapunov exponents. The random colored substitution network hence turns out to be a simple, powerful and promising model to generate random scale-free networks.
- 9 February 2024
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 152 (4) , 1377-1389
On the scale-freeness of random colored substitution networks
Extending previous results in the literature, random colored substitution networks and degree dimension are defined in this paper. The scale-freeness of these networks is proved by introducing a new definition for degree dimension that is associated with Lyapunov exponents. The random colored substitution network hence turns out to be a simple, powerful and promising model to generate random scale-free networks.
- Open Access
Group divisible designs with block size 4 and group sizes 4 and 7
In this paper, we consider the existence of group divisible designs (GDDs) with block size $4$ and group sizes $4$ and $7$. We show that there exists a 4-GDD of type $4^t 7^s$ for all but a finite specified set of feasible values for $(t, s)$.Open AccessGroup divisible designs with block size 4 and group sizes 4 and 7
In this paper, we consider the existence of group divisible designs (GDDs) with block size $4$ and group sizes $4$ and $7$. We show that there exists a 4-GDD of type $4^t 7^s$ for all but a finite specified set of feasible values for $(t, s)$. - Open AccessDirect constructions of some group divisible designs with block size $4$ and up to $50$ pointsIn this note, we give direct constructions of some group divisible designs (GDDs) with block size $4$ that have up to $50$ points.Open AccessDirect constructions of some group divisible designs with block size $4$ and up to $50$ pointsIn this note, we give direct constructions of some group divisible designs (GDDs) with block size $4$ that have up to $50$ points.
- 27 December 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (5) , 1279-1297
Harmonic Tutte polynomials of matroids II
- 27 December 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (5) , 1279-1297
Harmonic Tutte polynomials of matroids II