Answers are grounded in this paper and cite their sources.
Some new upper and lower bounds for the spectral radius of a nonnegative matrix are given by introducing the average of the average 3-row sum of matrices. The comparisons with the existing bounds using the average 3-row sums and the average of average 2-row sums are given by numerical examples. We also apply them to the adjacency matrix and the signless Laplacian matrix of digraphs or graphs.
No takes yet. Share an insight, caveat, or question.
Shi et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: