More inequalities for Laplacian indices by way of majorization

author

  • J. Palacios The University of New Mexico, Albuquerque, NM 87131, USA
Abstract:

The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG = 2|E|/n. We also find some particular tight bounds for some classes of graphs in terms of customary graph parameters.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Some Majorization Inequalities for Coneigenvalues∗

A new notion of coneigenvalue was introduced by Ikramov in [On pseudo-eigenvalues and singular numbers of a complex square matrix, (in Russian), Zap. Nauchn. Semin. POMI 334 (2006), 111-120]. This paper presents some majorization inequalities for coneigenvalues, which extend some classical majorization relations for eigenvalues and singular values, and may serve as a basis for further investiga...

full text

Distributed Majorization-Minimization for Laplacian Regularized Problems

We consider the problem of minimizing a block separable convex function (possibly nondifferentiable, and including constraints) plus Laplacian regularization, a problem that arises in applications including model fitting, regularizing stratified models, and multi-period portfolio optimization. We develop a distributed majorizationminimization method for this general problem, and derive a comple...

full text

Ela Some Majorization Inequalities for Coneigenvalues∗

A new notion of coneigenvalue was introduced by Ikramov in [Kh.D. Ikramov. On pseudo-eigenvalues and singular numbers of a complex square matrix (in Russian). Zap. Nauchn. Semin. POMI, 334:111–120, 2006.]. This paper presents some majorization inequalities for coneigenvalues, which extend some classical majorization relations for eigenvalues and singular values, and may serve as a basis for fur...

full text

Inequalities : Theory of majorization and its applications

insisting that the equality sign holds when k = n. Here, x[X] > • • • > x[n] are the xt arranged in decreasing order and, similarly, y[X] > • • • > y[n]. If (1) is only required for the increasing (decreasing) convex functions on R then one speaks of weak sub-majorization x >, respectively). The first is equivalent to (2). Let & be an open convex subset of R...

full text

On Majorization, Favard and Berwald Inequalities

In this paper, we obtain extensions of majorization type results and extensions of weighted Favard’s and Berwald’s inequality. We prove positive semi-definiteness of matrices generated by differences deduced from majorization type results and differences deduced from weighted Favard’s and Berwald’s inequality. This implies a surprising property of exponentially convexity and log-convexity of th...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 9  issue 1

pages  17- 24

publication date 2018-03-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023