相关论文: On minimum $ (K_{1,r};k) $-vertex stable graphs on…

A set $X \subseteq V(G)$ in a graph $G$ is $(q,k)$-unbreakable if every separation $(A,B)$ of order at most $k$ in $G$ satisfies $|A \cap X| \leq q$ or $|B \cap X| \leq q$. In this paper, we prove the following result: If a graph $G$…

Let $c:V\cup E\to\{1,2,\ldots,k\}$ be a (not necessarily proper) total colouring of a graph $G=(V,E)$ with maximum degree $\Delta$. Two vertices $u,v\in V$ are sum distinguished if they differ with respect to sums of their incident colours,…

The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fixed order $k$ and size $\ell$ a large graph $G$ on $n$…

For an arbitrary invariant $\rho (G)$ of a graph $G$, the $\rho-$vertex stability number $vs_{\rho}(G)$ is the minimum number of vertices of $G$ whose removal results in a graph $H\subseteq G$ with $\rho (H)\neq \rho (G)$ or with…

Consider classical Kneser's graph $K(n,r)$: for two natural numbers $ r, n $ such that $r \le n / 2$, its vertices are all the subsets of $[n]=\{1,2,\ldots,n\}$ of size $r$, and two such vertices are adjacent if the corresponding subsets…

The matching number of a $k$-graph is the maximum number of pairwise disjoint edges in it. The $k$-graph is called $t$-resilient if omitting $t$ vertices never decreases its matching number. The complete $k$-graph on $sk+k-1$ vertices has…

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…

Let $G$ be a graph with vertex set $V(G)$. Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$…

Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of…

An $r$-uniform hypergraph is uniquely $k$-colorable if there exists exactly one partition of its vertex set into $k$ parts such that every edge contains at most one vertex from each part. For integers $k \ge r \ge 2$, let $\Phi_{k,r}$…

A graph $G$ is said to be {\em hom-idempotent} if there is a homomorphism from $G^2$ to $G$, and {\em weakly hom-idempotent} if for some $n \geq 1$ there is a homomorphism from $G^{n+1}$ to $G^n$. Larose et al. [{\em Eur. J. Comb.…

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…

We prove that there exists an absolute constant $C>0$ such that, for any positive integer $k$, every graph $G$ with minimum degree at least $Ck$ admits a vertex-partition $V(G)=S\cup T$, where both $G[S]$ and $G[T]$ have minimum degree at…

Let $G=(V,E)$ be a graph of order $n$ and let $1\leq k< n$ be an integer. The $k$-token graph of $G$ is the graph whose vertices are all the $k$-subsets of $V$, two of which are adjacent whenever their symmetric difference is a pair of…

The $k$-dominating graph $D_k(G)$ of a graph $G$ is defined on the vertex set consisting of dominating sets of $G$ with cardinality at most $k$, two such sets being adjacent if they differ by either adding or deleting a single vertex. A…

The $k$th power of a graph $G$, denoted $G^k$, has the same vertex set as $G$, and two vertices are adjacent in $G^k$ if and only if there exists a path between them in $G$ of length at most $k$. A $K_r$-factor in a graph is a spanning…

A subset $S \subseteq V$ in a graph $G = (V,E)$ is called a $[1, k]$-set, if for every vertex $v \in V \setminus S$, $1 \leq | N_G(v) \cap S | \leq k$. The $[1,k]$-domination number of $G$, denoted by $\gamma_{[1, k]}(G)$ is the size of the…

The \textit{domination number} $\gamma(\mathcal{H})$ of a hypergraph $\mathcal{H}=(V(\mathcal{H}),E(\mathcal{H})$ is the minimum size of a subset $D\subset V(\mathcal{H}$ of the vertices such that for every $v\in V(\mathcal{H})\setminus D$…

A subset $D$ of the vertex set $V$ of a graph $G$ is called an $[1,k]$-dominating set if every vertex from $V-D$ is adjacent to at least one vertex and at most $k$ vertices of $D$. A $[1,k]$-dominating set with the minimum number of…

A stability result due to Ren, Wang, Wang and Yang [SIAM J. Discrete Math. 38 (2024)] shows that if $3\le r \le 2k$ and $n\ge 318 (r-2)^2k$, and $G$ is a $C_{2k+1}$-free graph on $n$ vertices with $e(G)\ge \lfloor {(n-r+1)^2}/{4}\rfloor +{r…