Some Stability Results on Graphs

Abstract

The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a corresponding graph with the same vertex and edge sets bearing the exact ideal structural property. We prove that the weight difference on the two graphs depends on the associated error and does not vary significantly.