English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We saythat $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the followingproperties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$for any $u,v$, where $G_{uv}$ is the graph obtained by applying Kelmansoperation from $u$ to $v$; (II) $\mathcal{P}(G) <\mathcal{P}(G+e)$ for any edge$e\notin E(G)$. Let $P_k$ be a path of order $k$, $\mathcal{C}_{\geq k}$ theset of all cycles of length at least $k$ and $M_{k+1}$ a matching containing$k+1$ independent edges. In this paper, we mainly prove the following threeresults: (i) Let $n\geq k\geq 5$ and let$t=\left\lfloor\frac{k-1}{2}\right\rfloor$. Let $G$ be a $2$-connected$n$-vertex $\mathcal{C}_{\geq k}$-free graph with the maximum $\mathcal{P}(G)$where $\mathcal{P}(G)$ is feasible. Then, $G\in\mathcal{G}^1_{n,k}=\{W_{n,k,s}=K_{s}\vee ((n-k+s)K_1\cup K_{k-2s}): 2\leqs\leq t\}$. (ii) Let $n\geq k\geq 4$ and let$t=\left\lfloor\frac{k}{2}\right\rfloor-1$. Let $G$ be a connected $n$-vertex$P_{k}$-free graph with the maximum $\mathcal{P}(G)$ where $\mathcal{P}(G)$ isfeasible. Then, $G\in \mathcal{G}^2_{n,k}=\{W_{n,k-1,s}=K_{s}\vee((n-k+s+1)K_1\cup K_{k-2s-1}): 1\leq s\leq t\}.$ (iii) Let $G$ be a connected$n$-vertex $M_{k+1}$-free graph with the maximum $\mathcal{P}(G)$ where$\mathcal{P}(G)$ is feasible. Then, $G\cong K_n$ when $n=2k+1$ and $G\in\mathcal{G}^3_{n,k}=\{K_s\vee ((n-2k+s-1)K_1\cup K_{2k-2s+1}):1\leq s\leq k\}$when $n\geq 2k+2$. Directly derived from these three main results, we obtain aseries of applications in Tur\'an-type problems, generalized Tur\'an-typeproblems, powers of graph degrees in extremal graph theory, and problemsrelated to spectral radius, and signless Laplacian spectral radius in spectralgraph theory.

Graph operations and a unified method for kinds of Tur\'an-type problems on paths, cycles and matchings