If $A$ is a positive square matrix, then the Collatz–Wielandt implies that
$\min_{𝑖=1,…,𝑛;𝑦_𝑖\neq 0}\frac{(Ay)_i}{y_i}≤𝑟≤\max_{𝑖=1,…,𝑛;𝑦_𝑖\neq 0}\frac{(Ay)_i}{y_i}$, Where $r$ is the largest eigenvalue of $A$.
By replacing $y=e_j$ in the previous expression wouldn't we obtain that $a_{jj}\leq r \leq a_{jj}$ for each $j\in\{1,\ldots,n\}$? This cannot be true for a matrix $A$ that has different arguments in the diagonal.
The previous inequality is from @Surb’s answer in here: Lower and upper bound for the largest eigenvalue.