Related papers: Unstable Graphs: A Fresh Outlook via TF-Automorphi…
This paper introduces and studies the stability of the strong domination number of a graph, denoted $\operatorname{st}_{\gamma_{st}}(G)$, defined as the minimum number of vertices whose removal changes the strong domination number…
The notion of smoothness was introduced originally in the context of step systems on connected graphs. Smoothness turns out to be a very general property of metrics defined by a five-point condition. Restricted to graphs, it is closely…
In a non-compact setting, the notion of hyperbolicity, and the associated structure of stable and unstable manifolds (for unbounded orbits), is highly dependent on the choice of metric used to define it. We consider the simplest version of…
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)]…
Given a graph G = (V,E), a vertex subset S is called t-stable (or t-dependent) if the subgraph G[S] induced on S has maximum degree at most t. The t-stability number of G is the maximum order of a t-stable set in G. We investigate the…
We present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analytic limit version of the problem. We show that, for example,…
Boesch, Li, and Suffel were the first to identify the existence of uniformly optimally reliable graphs (UOR graphs), graphs which maximize all-terminal reliability over all graphs with $n$ vertices and $m$ edges. The all-terminal…
Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…
Graph neural networks (GNNs) have emerged as a powerful tool for nonlinear processing of graph signals, exhibiting success in recommender systems, power outage prediction, and motion planning, among others. GNNs consists of a cascade of…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
This paper, we explore the dynamics of threshold networks on undirected signed graphs. Much attention has been dedicated to understanding the convergence and long-term behavior of this model. Yet, an open question persists: How does the…
In this paper we study graphs which admit acyclic orientations that contain a pair of arc-disjoint out-branching and in-branching (such an orientation is called good) and we focus on edge-minimal such graphs. A 2T-graph is a graph whose…
We prove that the Kuramoto model on a graph can contain infinitely many non-equivalent stable equilibria. More precisely, we prove that for every positive integer d there is a connected graph such that the set of stable equilibria contains…
Lov\'asz has completely characterised the structure of graphs with no two vertex-disjoint cycles, while Slilaty has given a structural characterisation of graphs with no two vertex-disjoint odd cycles; his result is in fact more general,…
We study the stability of opinion dynamics in the time-varying Friedkin-Johnsen (TVFJ) model, which captures both persistent individual biases and adaptive social influence. We introduce two temporal structures, defected temporal graphs…
We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…
Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…
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…
This work investigates the morphological stability of a soft body composed of two heavy elastic layers, attached to a rigid surface and subjected only to the bulk gravity force. Using theoretical and computational tools, we characterize the…
An old problem raised independently by Jacobson and Sch\"onheim asks to determine the maximum $s$ for which every graph with $m$ edges contains a pair of edge-disjoint isomorphic subgraphs with $s$ edges. In this paper we determine this…