A majorization method for localizing graph topological indices

This paper presents a unified approach for localizing some relevant graph topological indices via majorization techniques. Through this method, old and new bounds are derived and numerical examples are provided, showing how former results in the literature could be improved.Comment: 11 page

On the Randi\'{c} index and conditional parameters of a graph

The aim of this paper is to study some parameters of simple graphs related with the degree of the vertices. So, our main tool is the $n\times n$ matrix ${\cal A}$ whose ($i,j$)-entry is $$a_{ij}= \left\lbrace \begin{array}{ll} \frac{1}{\sqrt{\delta_i\delta_j}} & {\rm if }\quad v_i\sim v_j ; \\ 0 & {\rm otherwise,} \end{array} \right.$$ where $\delta_i$ denotes the degree of the vertex $v_i$. We study the Randi\'{c} index and some interesting particular cases of conditional excess, conditional Wiener index, and conditional diameter. In particular, using the matrix ${\cal A}$ or its eigenvalues, we obtain tight bounds on the studied parameters.Comment: arXiv admin note: text overlap with arXiv:math/060243