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

For a set of graphs $\mathcal{F}$, let $\ex(n,\mathcal{F})$ and$\spex(n,\mathcal{F})$ denote the maximum number of edges and the maximumspectral radius of an $n$-vertex $\mathcal{F}$-free graph, respectively.Nikiforov ({\em LAA}, 2007) gave the spectral version of the Tur\'an Theorem byshowing that $\spex(n, K_{k+1})=\lambda (T_{k}(n))$, where $T_k(n)$ is the$k$-partite Tur\'an graph on $n$ vertices. In the same year, Feng, Yu and Zhang({\em LAA}) determined the exact value of $\spex(n, M_{s+1})$, where $M_{s+1}$is a matching with $s+1$ edges. Recently, Alon and Frankl~(arXiv2210.15076)gave the exact value of $\ex(n,\{K_{k+1},M_{s+1}\})$. In this article, we givethe spectral version of the result of Alon and Frankl by determining the exactvalue of $\spex(n,\{K_{k+1},M_{s+1}\})$ when $n$ is large.

Spectral extrema of graphs with bounded clique number and matching number