Related papers: Fibonacci Index and Stability Number of Graphs: a …
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…
Trophic coherence, a measure of a graph's hierarchical organisation, has been shown to be linked to a graph's structural and dynamical aspects such as cyclicity, stability and normality. Trophic levels of vertices can reveal their…
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the…
The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive $1$s. Munarini introduced Pell graphs, a variation of Fibonacci cubes defined on ternary strings. A generalization of Pell graphs…
Let $\mathscr{F}$ be a family of graphs. A graph $G$ is $\mathscr{F}$-free if $G$ does not contain any $F\in \mathscr{F}$ as a subgraph. The Tur\'an number, denoted by $ex(n, \mathscr{F})$, is the maximum number of edges in an $n$-vertex…
This paper examines stability properties of distance-based formation control when the underlying topology consists of a rigid graph and a flex node addition. It is shown that the desired equilibrium set is locally asymptotically stable but…
The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are…
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
The aim of this work is to investigate the nonnegative signed domination number $\gamma^{NN}_s$ with emphasis on regular, ($r+1$)-clique-free graphs and trees. We give lower and upper bounds on $\gamma^{NN}_s$ for regular graphs and prove…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…
The Tur\'an number of a graph $F$, $ex(n,F)$, is the maximum number of edges in a graph on $n$ vertices which does not contain $F$ as a subgraph. Let $S_{a,b}$ denote a double star with a central edge $uv$, $a$ leaves connected to $u$ and…
By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…
The Turan bound is a famous result in graph theory, which relates the independence number of an undirected graph to its edge density. Also the Caro-Wei inequality, which gives a more refined bound in terms of the vertex degree sequence of a…
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…
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…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise…
There is a family of vector bundles over the moduli space of stable curves that, while first appearing in theoretical physics, has been an active topic of study for algebraic geometers since the 1990s. By computing the rank of the…
For fixed graphs $H$ and $F$, the \emph{generalized Tur\'an number} $\mathrm{ex}(n,H,F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$-vertex $F$-free graph. This article is a survey of this extremal function whose…