相关论文: On the Structure of $\alpha $-Stable Graphs

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing stability, of a graph $G$ is denoted by…

A graph $\Gamma$ is said to be stable if for the direct product $\Gamma\times\mathbf{K}_2$, ${\rm Aut}(\Gamma \times \mathbf{K}_2)$ is isomorphic to ${\rm Aut}(\Gamma) \times \mathbb{Z}_2$; otherwise, it is called unstable. An unstable…

The chromatic vertex (resp.\ edge) stability number ${\rm vs}_{\chi}(G)$ (resp.\ ${\rm es}_{\chi}(G)$) of a graph $G$ is the minimum number of vertices (resp.\ edges) whose deletion results in a graph $H$ with $\chi(H)=\chi(G)-1$. In the…

Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the…

Let $G$ be a graph without isolated vertices and let $\alpha(G)$ be its stability number and $\tau(G)$ its covering number. The {\it $\alpha_{v}$-cover} number of a graph, denoted by $\alpha_{v}(G)$, is the maximum natural number $m$ such…

A pair of graphs $(\Gamma,\Sigma)$ is said to be stable if the full automorphism group of $\Gamma\times\Sigma$ is isomorphic to the product of the full automorphism groups of $\Gamma$ and $\Sigma$ and unstable otherwise, where…

The $\Delta$-edge stability number ${\rm es}_{\Delta}(G)$ of a graph $G$ is the minimum number of edges of $G$ whose removal results in a subgraph $H$ with $\Delta(H) = \Delta(G)-1$. Sets whose removal results in a subgraph with smaller…

The canonical double cover $\mathrm{D}(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\mathrm{Aut}(\mathrm{D}(\Gamma))=\mathrm{Aut}(\Gamma)\times\mathbb{Z}_2$ then $\Gamma$ is called stable; otherwise $\Gamma$…

A graph pair $(\Gamma, \Sigma)$ is called stable if $\aut(\Gamma)\times\aut(\Sigma)$ is isomorphic to $\aut(\Gamma\times\Sigma)$ and unstable otherwise, where $\Gamma\times\Sigma$ is the direct product of $\Gamma$ and $\Sigma$. A graph is…

In an improper colouring an edge $uv$ for which, $c(u)=c(v)$ is called a \emph{bad edge}. The notion of the \emph{chromatic completion number} of a graph $G$ denoted by $\zeta(G),$ is the maximum number of edges over all chromatic…

An automorphism on a graph $G$ is a bijective mapping on the vertex set $V(G)$, which preserves the relation of adjacency between any two vertices of $G$. An automorphism $g$ fixes a vertex $v$ if $g$ maps $v$ onto itself. The stabilizer of…

Given graphs $H$ and $F$, $\mathrm{ex}(n,H,F)$ denotes the largest number of copies of $H$ in $F$-free $n$-vertex graphs. Let $\chi(H)<\chi(F)=r+1$. We say that $H$ is $F$-Tur\'an-stable if the following holds. For any $\varepsilon>0$ there…

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…

The fixing number of a graph $G$ is the order of the smallest subset $S$ of its vertex set $V(G)$ such that stabilizer of $S$ in $G$, $\Gamma_{S}(G)$ is trivial. Let $G_{1}$ and $G_{2}$ be disjoint copies of a graph $G$, and let…

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…

A graph $G$ is well-covered if all its maximal stable sets have the same size, denoted by alpha(G) (M. D. Plummer, 1970). If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$…

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…

A graph $G$ is $\alpha$-excellent if every vertex of $G$ is contained in some maximum independent set of $G$. In this paper, we characterize $\alpha$-excellent bipartite graphs, $\alpha$-excellent unicyclic graphs, $\alpha$-excellent…

An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-weight capacity-matching equals the value of a maximum-weight fractional capacity-matching. Stable graphs play a key role in characterizing the…

Given a hereditary family $\mathcal{G}$ of admissible graphs and a function $\lambda(G)$ that linearly depends on the statistics of order-$\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining…