Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the spectral extremal problem of planar graphs (2402.16419v1)

Published 26 Feb 2024 in math.CO

Abstract: The spectral extremal problem of planar graphs has aroused a lot of interest over the past three decades. In 1991, Boots and Royle Geogr. Anal. 23(3) (1991) 276--282 conjectured that $K_2 + P_{n-2}$ is the unique graph attaining the maximum spectral radius among all planar graphs on $n$ vertices, where $K_2 + P_{n-2}$ is the graph obtained from $K_2\cup P_{n-2}$ by adding all possible edges between $K_2$ and $P_{n-2}$. In 2017, Tait and Tobin [J. Combin. Theory Ser. B 126 (2017) 137--161] confirmed this conjecture for all sufficiently large $n$. In this paper, we consider the spectral extremal problem for planar graphs without specified subgraphs. For a fixed graph $F$, let $\mathrm{SPEX}{\mathcal{P}}(n,F)$ denote the set of graphs attaining the maximum spectral radius among all $F$-free planar graphs on $n$ vertices. We describe a rough sturcture for the connected extremal graphs in $\mathrm{SPEX}{\mathcal{P}}(n,F)$ when $F$ is a planar graph not contained in $K_{2,n-2}$. As applications, we determine the extremal graphs in $\mathrm{SPEX}{\mathcal{P}}(n,W_k)$, $\mathrm{SPEX}{\mathcal{P}}(n,F_k)$ and $\mathrm{SPEX}_{\mathcal{P}}(n,(k+1)K_2)$ for all sufficiently large $n$, where $W_k$, $F_k$ and $(k+1)K_2$ are the wheel graph of order $k$, the friendship graph of order $2k+1$ and the disjoint union of $k+1$ copies of $K_2$, respectively.

Citations (1)

Summary

We haven't generated a summary for this paper yet.