English

Extremal spectral results of planar graphs without vertex-disjoint cycles

Combinatorics 2023-12-19 v3

Abstract

Given a planar graph family F\mathcal{F}, let exP(n,F){\rm ex}_{\mathcal{P}}(n,\mathcal{F}) and spexP(n,F){\rm spex}_{\mathcal{P}}(n,\mathcal{F}) be the maximum size and maximum spectral radius over all nn-vertex F\mathcal{F}-free planar graphs, respectively. Let tCtC_{\ell} be the disjoint union of tt copies of \ell-cycles, and tCt\mathcal{C} be the family of tt vertex-disjoint cycles without length restriction. Tait and Tobin [Three conjectures in extremal spectral graph theory, J. Combin. Theory Ser. B 126 (2017) 137--161] determined that K2+Pn2K_2+P_{n-2} is the extremal spectral graph among all planar graphs with sufficiently large order nn, which implies the extremal graphs of both spexP(n,tC){\rm spex}_{\mathcal{P}}(n,tC_{\ell}) and spexP(n,tC){\rm spex}_{\mathcal{P}}(n,t\mathcal{C}) for t3t\geq 3 are K2+Pn2K_2+P_{n-2}. In this paper, we first determine spexP(n,tC){\rm spex}_{\mathcal{P}}(n,tC_{\ell}) and spexP(n,tC){\rm spex}_{\mathcal{P}}(n,t\mathcal{C}) and characterize the unique extremal graph for 1t21\leq t\leq 2, 3\ell\geq 3 and sufficiently large nn. Secondly, we obtain the exact values of exP(n,2C4){\rm ex}_{\mathcal{P}}(n,2C_4) and exP(n,2C){\rm ex}_{\mathcal{P}}(n,2\mathcal{C}), which solve a conjecture of Li [Planar Tur\'an number of the disjoint union of cycles, Discrete Appl. Math. 342 (2024) 260--274] for n2661n\geq 2661.

Keywords

Cite

@article{arxiv.2304.06942,
  title  = {Extremal spectral results of planar graphs without vertex-disjoint cycles},
  author = {Longfei Fang and Huiqiu Lin and Yongtang Shi},
  journal= {arXiv preprint arXiv:2304.06942},
  year   = {2023}
}