On Weighted Convex Graphs
Angshuman R. Goswami
Abstract
The main objective of this paper is to develop Krein-Milman-type theorems and Ulam-type stability results for graphs. To establish these results, we introduce several meaningful definitions of vertex-weighted convex graphs inspired by the concept of sequential convexity. We also present a close relationship between the two discrete structures, namely sequential convexity and perfect binary trees. We show that if a graph satisfies a certain convexity property approximately, then this property can be made exact by minimally perturbing the weights assigned to its vertices. Furthermore, we study several structural characterisations, formulate convex minorants for weighted graphs, and derive sandwich-type results. Special emphasis is placed on trees, and an investigation of extremal value problems is also carried out
Create a lesson
Related papers
A Note on the Measure of Vector and Pythagorean Theorem
Yu. V. Brezhnev
On characterizations, Decompositions, and Stability of Convex Sequences
Angshuman R. Goswami
New Laplace convolution integrals involving exponential, error, and parabolic cylinder functions with applications in heat transfer and linear viscoelasticity
González Santander, Juan Luis
Resolution of Singularities in Positive Characteristic: Frobenius-Hasse Towers and Exceptional-History Descent
Chenxiao Tian
Information Geometry (IG) Lives at Edge or Boundary of SMG (statistically meaningful geometry): - the First Edge Theorem and Applications
Bing Cheng, Yi-Shuai Niu, Howell Tong et al.
From the Half-Order Recurrence to General Fractional-Order Differentiation on Monomials: Functional Continuation and Operator Composition
Davit Kapanadze