Extremal spectral results of planar graphs without vertex‐disjoint cycles
Extremal spectral results of planar graphs without vertex‐disjoint cycles
Abstract Given a planar graph family , let and be the maximum size and maximum spectral radius over all ‐vertex ‐free planar graphs, respectively. Let be the disjoint union of copies of ‐cycles, and be the family of vertex‐disjoint cycles without length restriction. Tait and Tobin determined that is the …