Related papers: Some Stability Results on Graphs
A graph with convex quadratic stability number is a graph for which the stability number is determined by solving a convex quadratic program. Since the very beginning, where a convex quadratic programming upper bound on the stability number…
The paper deals with the stability of the fundamental equation of information of multiplicative type. It will be proved that the equation in question is stable in the sense of Hyers and Ulam under some assumptions. This result will be…
It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…
We introduce a new concept of Hyers-Ulam stability, in which in the size of a pseudosolution of a given ordinary differential equation and its deviation from an exact solution are measured with respect to different norms. These norms are…
The purpose of this paper is to summarize the recent results on the stability of the parametric fundamental equation of information. Furthermore, by the help of a modification of a method we used in \cite{GM08} we shall give a unified proof…
Given graphs $H$ and $F$, the generalized Tur\'an number $\mathrm{ex}(n,H,F)$ is the largest number of copies of $H$ in $n$-vertex $F$-free graphs. Stability refers to the usual phenomenon that if an $n$-vertex $F$-free graph $G$ contains…
The stability problem in Ulam's sense has recently been explored in locally convex cone environments, as shown in \cite{ MNF, NR1, NR2}. In continuation of this research direction, our work examines the stability properties of the quadratic…
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…
This paper explores the Hyers-Ulam stability of generalized Jensen additive and quadratic functional equations in \(\beta\)-homogeneous \(F\)-space, showing that approximately satisfying mappings have a unique exact approximating…
In recent years several classical results in extremal graph theory have been improved in a uniform way and their proofs have been simplified and streamlined. These results include a new Erd\H{o}s-Stone-Bollob\'as theorem, several stability…
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and…
This paper presents a formal definition of stability for node centrality measures in weighted graphs. It is shown that the commonly used measures of degree, closeness and eigenvector centrality are stable whereas betweenness centrality is…
We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs $(\Gamma,\Sigma)$ is stable if $Aut(\Gamma\times\Sigma) \cong…
In this paper we obtain a result on Hyers-Ulam stability of the linear functional equation in a single variable $f(\varphi(x)) = g(x) \cdot f(x)$ on a complete metric group.
A graph $X$ is said to be unstable if the direct product $X\times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is non-trivially unstable if it is…
The main purpose of this paper is to prove the generalized Hyers-Ulam-Rassias stability of J*-homomorphisms between J*-algebras.
A pair of graphs $(\Gamma,\Sigma)$ is called unstable if their direct product $\Gamma\times\Sigma$ admits automorphisms not from $\mathrm{Aut}(\Gamma)\times\mathrm{Aut}(\Sigma)$, and such automorphisms are said to be unexpected. The…
This paper introduces the concept of Hyers-Ulam stability for linear relations in normed linear spaces and presents several intriguing results that characterize the Hyers-Ulam stability of closed linear relations in Hilbert spaces.…
Graph convolutional neural networks (GCNNs) are nonlinear processing tools to learn representations from network data. A key property of GCNNs is their stability to graph perturbations. Current analysis considers deterministic perturbations…
In this paper, we study the stability result of a well-known theorem of Bondy. We prove that for any 2-connected non-hamiltonian graph, if every vertex except for at most one vertex has degree at least $k$, then it contains a cycle of…