A majorization method for localizing graph topological indices

DOI10.1016/J.DAM.2013.04.023MaRDI QIDQ2444566zbMATH OpenOpenAlexFDO

Authors Alessandra Cornaro, Anna Torriero, Monica Bianchi

Publication date 10 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1105.3631

zbMATH Keywords

majorizationSchur-convex functionstopological indices

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Convexity of real functions of several variables, generalizations (26B25)

Abstract: 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.

Recommendations

• Majorization under constraints and bounds on the second Zagreb index
• Extermal trees with respect to some versions of Zagreb indices via majorization
• A unified approach to bounds for topological indices on trees and applications
• Unified extremal results of topological indices and spectral invariants of graphs
• Recent results on the majorization theory of graph spectrum and topological index theory

Cites work

• A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
• A note on sum of powers of the Laplacian eigenvalues of graphs
• Energy of a graph
• Extremal properties of graphs and eigencentrality in trees with a given degree sequence
• Graphs of extremal weights
• scientific article; zbMATH DE number 1618184 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 5259316 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Inequalities: theory of majorization and its applications
• Majorization under constraints and bounds on the second Zagreb index
• Maximal energy bipartite graphs
• Maximal energy graphs
• More estimates for eigenvalues and singular values
• More on the Laplacian Estarda index
• On a novel connectivity index
• On resistance-distance and Kirchhoff index
• On sum of powers of the Laplacian eigenvalues of graphs
• On the general sum-connectivity index of trees
• Some localization theorems using a majorization technique
• Some upper bounds for the energy of graphs
• The Laplacian Spectrum of a Graph II

Cited in

(15)

• Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices
• Extremal polygonal cacti for bond incident degree indices
• Extremal graphs with respect to variable sum exdeg index via majorization
• Bounds for the augmented Zagreb and the atom-bond connectivity indices
• Bounds for the Kirchhoff index via majorization techniques
• Bounds for the global cyclicity index of a general network via weighted majorization
• New bounds of degree-based topological indices for some classes of \(c\)-cyclic graphs
• On a new cyclicity measure of graphs -- the global cyclicity index
• Topological indices of the line graph of subdivision graphs and their Schur-bounds
• Bounding the \(HL\)-index of a graph: a majorization approach
• Paths and animals in infinite graphs with tempered degree growth
• Some new lower bounds for the Kirchhoff index of a graph
• Majorization under constraints and bounds on the second Zagreb index
• Bounding robustness in complex networks under topological changes through majorization techniques
• On topological indices, graph compression, and threshold graphs

This page was built for publication: A majorization method for localizing graph topological indices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444566)