Abstract
In this paper, we present monotone sequences of lower and upper bounds on the Perron value of a nonnegative matrix, and we study their strict monotonicity. Using those sequences, we provide two combinatorial applications. One is to improve bounds on Perron values of rooted trees in combinatorial settings, in order to find characteristic sets of trees. The other is to generate log-concave and log-convex sequences through the monotone sequences.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call