Related papers: Stability of Rose Window graphs
A proper vertex coloring of a graph is a mapping of its vertices on a set of colors, such that two adjacent vertices are not mapped to the same color. This constraint may be interpreted in terms of the distance between to vertices and so a…
A graph $\Gamma$ is $k$-connected-homogeneous ($k$-CH) if $k$ is a positive integer and any isomorphism between connected induced subgraphs of order at most $k$ extends to an automorphism of $\Gamma$, and connected-homogeneous (CH) if this…
A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and…
The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While…
We give an example of a symplectic manifold with a stable hypersurface such that nearby hypersurfaces are typically unstable.
We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…
Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…
The cyclic subgroup graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any…
The stable roommates problem is a non-bipartite version of the stable matching problem in a bipartite graph. In this paper, we consider the stable roommates problem with ties. In particular, we focus on strong stability, which is one of the…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
Randomly-assembled dynamical systems are theoretically predicted to be unstable upon crossing a critical threshold of complexity, as first shown by May. Yet, empirical complex systems exhibit remarkable stability, indicating the presence of…
O'Donnell, Wright, Wu and Zhou [SODA 2014] introduced the notion of robustly asymmetric graphs. Roughly speaking, these are graphs in which for every $0 \le \rho \le 1$, every permutation that permutes a $\rho$ fraction of the vertices maps…
Consider a connected homogeneous Riemannian manifold $(M,ds^2)$ and a Riemannian covering $(M,ds^2) \to \Gamma \backslash (M,ds^2)$. If $\Gamma \backslash (M,ds^2)$ is homogeneous then every $\gamma \in \Gamma$ is an isometry of constant…
A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…
Suppose that two vector fields on a smooth manifold render some equilibrium point globally asymptotically stable (GAS). We show that there exists a homotopy between the corresponding semiflows such that this point remains GAS along this…
Let X be a non-empty finite set and alpha a symmetric bilinear form on a real finite dimensional vector space E. We say that a set GG={U_i | i in X} of linear lines in E is an isometric sheaf, if there exist generators u_i of the lines U_i,…
We construct an open set of structurally unstable three parameter families whose weak and so called moderate topological classification defined below has a numerical invariant that may take an arbitrary positive value. Here and below…
A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.
Let $G_n=\mathbb{Z}_n\times \mathbb{Z}_n$ for $n\geq 4$ and $S=\{(i,0),(0,i),(i,i): 1\leq i \leq n-1\}\subset G_n$. Define $\Gamma(n)$ to be the Cayley graph of $G_n$ with respect to the connecting set $S$. It is known that $\Gamma(n)$ is a…