Generalizations of Szőkefalvi Nagy and Chebyshev inequalities with applications in spectral graph theory

Ivan Gutman, Kinkar Ch. Das, Boris Furtula, Emina Milovanović and Igor Milovanović

Applied Mathematics and Computation, 2017, vol. 313, issue C, 235-244

Abstract: Two weighted inequalities for real non-negative sequences are proven. The first one represents a generalization of the Szőkefalvi Nagy inequality for the variance, and the second a generalization of the discrete Chebyshev inequality for two real sequences. Then, the obtained inequalities are used to determine lower bounds for some degree-based topological indices of graphs.

Keywords: Szőkefalvi Nagy inequality; Chebyshev inequality; Topological index; Degree–based topological index; Zagreb indices (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317303764
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:313:y:2017:i:c:p:235-244

DOI: 10.1016/j.amc.2017.05.064

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().