Strictly monotone sequences of lower and upper bounds on Perron values and their combinatorial applications
From MaRDI portal
Publication:6404806
arXiv2207.06016MaRDI QIDQ6404806FDOQ6404806
Authors: Sooyeong Kim, Min Ho Song 
Publication date: 13 July 2022
Abstract: In this paper, we present monotone sequences of lower and upper bounds on the Perron value of a nonngeative 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.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Combinatorial inequalities (05A20)
This page was built for publication: Strictly monotone sequences of lower and upper bounds on Perron values and their combinatorial applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404806)
