A method to compute the strength using bounds

A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\{1,2, \ldots, n \}$ to the vertices of $G$. The strength $\mathrm{str}\left(G\right)$ of $G$ is defined by $\mathrm{str}\left( G\right) =\min \left\{ \mathrm{str}_{f}\left( G\right)\left\vert f\text{ is a numbering of }G\right. \right\}$, where $\mathrm{str}_{f}\left( G\right) =\max \left\{ f\left( u\right) +f\left( v\right) \left\vert uv\in E\left( G\right) \right. \right\}$. A few lower and upper bounds for the strength are known and, although it is in general hard to compute the exact value for the strength, a reasonable approach to this problem is to study for which graphs a lower bound and an upper bound for the strength coincide. In this paper, we study general conditions for graphs that allow us to determine which graphs have the property that lower and upper bounds for the strength coincide and other graphs for which this approach is useless.