# A majorization method for localizing graph topological indices

@article{Bianchi2013AMM, title={A majorization method for localizing graph topological indices}, author={Monica Bianchi and Alessandra Cornaro and Anna Torriero}, journal={Discret. Appl. Math.}, year={2013}, volume={161}, pages={2731-2739} }

## 21 Citations

Bounding the Sum of Powers of Normalized Laplacian Eigenvalues of Graphs through Majorization Methods

- Mathematics
- 2013

Given a simple connected graph G, this paper presents a new approach for localizing the graph topological indices given by the sum of the α-th power of the non zero normalized Laplacian eigenvalues.…

Topological indices of the line graph of subdivision graphs and their Schur-bounds

- MathematicsAppl. Math. Comput.
- 2015

Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices

- MathematicsDiscret. Appl. Math.
- 2019

New bounds of degree-based topological indices for some classes of c-cyclic graphs

- MathematicsDiscret. Appl. Math.
- 2015

Novel Bounds for the Normalized Laplacian Estrada and Normalized Energy Index of Graphs

- Mathematics
- 2015

For a simple and connected graph, several lower and upper bounds of graph invariants expressed in terms of the eigenvalues of the normalized Laplacian matrix have been proposed in literature. In this…

Graph Invariants of Trees with Given Degree Sequence

- Mathematics, Computer Science
- 2017

This work explores generalizations of graph indices defined on graph structures that stay the same under taking graph isomorphisms and the corresponding extremal problems in trees.

Bounds for the augmented Zagreb and the atom-bond connectivity indices

- MathematicsAppl. Math. Comput.
- 2017

Extremal graphs with respect to variable sum exdeg index via majorization

- MathematicsAppl. Math. Comput.
- 2017

New bounds for the sum of powers of normalized Laplacian eigenvalues of graphs

- MathematicsArs Math. Contemp.
- 2016

The eigenvalues of the normalized Laplacian matrix are localized by adapting a theoretical method proposed in Bianchi and Torriero (2000), based on majorization techniques, to derive upper and lower bounds of s α * ( G ) .

On a new cyclicity measure of graphs - The global cyclicity index

- MathematicsDiscret. Appl. Math.
- 2014

## References

SHOWING 1-10 OF 40 REFERENCES

Majorization under constraints and bounds of the second Zagreb index

- Mathematics, Computer Science
- 2011

A theoretical analysis is presented in order to establish maximal and minimal vectors with respect to the majorization order of particular subsets of a graph known as the second Zagreb index.

A Lower Bound for the Laplacian Eigenvalues of a Graph-Proof of a Conjecture by Guo

- Mathematics
- 2008

We show that the j-th largest Laplacian eigenvalue of a connected graph on n vertices is at least dj-j+2 (j=1,...,n), where dj is the j-th largest degree. This settles a conjecture due to Guo.

More on the Laplacian Estrada index

- Mathematics
- 2009

Let G be a graph with n vertices and let μ1, μ2, . . . , μn be its Laplacian eigenvalues. In some recent works a quantity called Laplacian Estrada index was considered, defined as LEE(G)Σn1 eμi. We…

Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence

- Mathematics, Computer Science
- 2010

It is proved that in trees with maximum S(G) the eigen vector ordering is coherent with the degree ordering; that is, degree central vertices are also eigenvector central.

ON SUM OF POWERS OF LAPLACIAN EIGENVALUES AND LAPLACIAN ESTRADA INDEX OF GRAPHS

- Mathematics
- 2009

Let G be a simple graph and α a real number. The quantity sα(G) defined as the sum of the α-th power of the non-zero Laplacian eigenvalues of G generalizes several concepts in the literature. The…

On a novel connectivity index

- Mathematics
- 2009

We present a novel connectivity index for (molecular) graphs, called sum-connectivity index and give several basic properties for this index, especially lower and upper bounds in terms of graph…