# Strong rainbow connection numbers of toroidal meshes

## TL;DR

This paper improves the upper bound on the strong rainbow connection number of toroidal meshes, providing a tighter estimate and resolving an open problem posed by Li et al. in 2011.

## Contribution

The authors significantly refine the upper bound for the strong rainbow connection number of toroidal meshes, offering a negative answer to a previously open problem.

## Key findings

- Improved upper bound on the strong rainbow connection number
- Negative resolution to Li et al.'s open problem
- Enhanced understanding of rainbow connectivity in toroidal meshes

## Abstract

In 2011, Li et al. \cite{LLL} obtained an upper bound of the strong rainbow connection number of an $r$-dimensional undirected toroidal mesh. In this paper, this bound is improved. As a result, we give a negative answer to their problem.