Related papers: Stability number and f-factors in graphs
Understanding which system structure can sustain stable dynamics is a fundamental step in the design and analysis of large scale dynamical systems. Towards this goal, we investigate here the structural stability of systems with a random…
Graph convolutional neural networks (GCNNs) have emerged as powerful tools for analyzing graph-structured data, achieving remarkable success across diverse applications. However, the theoretical understanding of the stability of these…
This paper studies the graph-theoretic conditions for stability of positive monotone systems. Using concepts from input-to-state stability and network small-gain theory, we first establish necessary and sufficient conditions for the…
In data transmission networks, the availability of data transmission is equivalent to the existence of the fractional factor of the corresponding graph which is generated by the network. Research on the existence of fractional factors under…
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and…
Given a graph $F$, a hypergraph is called a Berge-$F$ if it can be obtained by expanding each edge of $F$ into a hyperedge containing it. Let $M_{k}$ denote the matching of size $k$. Kang, Ni, and Shan [12] determined the Tur\'an number of…
The scattering number $s(G)$ of graph $G=(V,E)$ is defined as $s(G)$=max\big\{$c(G-S)-|S|$\big\}, where the maximum is taken over all proper subsets $S\subseteq V(G)$, and $c(G-S)$ denotes the number of components of $G-S$. In 1988, Enomoto…
This technical report replies to the comments of [2] in detail, and corrects a possible mis-interpretation of [1] in terms of the conventional robust stability concept. After defining the robust stability and quadratic stability concepts,…
We extend the classical stability theorem of Erdos and Simonovits for forbidden graphs of logarithmic order.
In this paper we introduce a new property for normed algebras. This property which we call it stability, plays a key role in the studying of the theory of almost multiplier maps. In this note we study some of the basic properties of this…
In this paper, we consider the Kirchhoff plate equation with delay terms on the boundary control are added (see system \eqref{p5-2.1} below). we give some instability examples of system \eqref{p5-2.1} for some choices of delays. Finally, we…
We introduce a modification of the Tur\'an density of ordered graphs and investigate this graph parameter.
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…
Both the Simonovits stability theorem and the Nikiforov spectral stability theorem are powerful tools for solving exact values of Tur\'{a}n numbers in extremal graph theory. Recently, F\"{u}redi [J. Combin. Theory Ser. B 115 (2015)]…
This work establishes rigorous, novel and widely applicable stability guarantees and transferability bounds for graph convolutional networks -- without reference to any underlying limit object or statistical distribution. Crucially,…
For a nonnegative integer $k$, a graph $G$ is said to be $k$-factor-critical if $G-Q$ admits a perfect matching for any $Q\subseteq V(G)$ with $|Q|=k$. In this article, we prove spectral radius conditions for the existence of…
We present new combinatorial insights into the calculation of (Castelnuovo-Mumford) regularity of graphs.
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…
The \textit{node reliability} of a graph $G$ is the probability that at least one node is operational and that the operational nodes can all communicate in the subgraph that they induce, given that the edges are perfectly reliable but each…
The stability number of a graph G, is the cardinality of a stable set of maximum size in G. If the stability number of G remains the same upon the addition of any edge, then G is called $\alpha ^{+}$-stable. G is a K\"{o}nig-Egervary graph…