More inequalities for Laplacian indices by way of majorization
نویسنده
چکیده مقاله:
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.
منابع مشابه
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...
متن کامل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...
متن کامل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...
متن کامل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...
متن کامل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...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 9 شماره 1
صفحات 17- 24
تاریخ انتشار 2018-03-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023