Extremal spectral results of planar graphs without vertex-disjoint cycles

Abstract

Given a planar graph family F, let exP(n,F) and spexP(n,F) be the maximum size and maximum spectral radius over all n-vertex F-free planar graphs, respectively. Let tC be the disjoint union of t copies of -cycles, and tC be the family of t 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+Pn-2 is the extremal spectral graph among all planar graphs with sufficiently large order n, which implies the extremal graphs of both spexP(n,tC) and spexP(n,tC) for t≥ 3 are K2+Pn-2. In this paper, we first determine spexP(n,tC) and spexP(n,tC) and characterize the unique extremal graph for 1≤ t≤ 2, ≥ 3 and sufficiently large n. Secondly, we obtain the exact values of exP(n,2C4) and exP(n,2C), which solve a conjecture of Li [Planar Tur\'an number of the disjoint union of cycles, Discrete Appl. Math. 342 (2024) 260--274] for n≥ 2661.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…