arXiv (All)
open access
Spectral Extremal 1-Planar Graphs with Bounded Pentagon Packing
Let $\mathcal P_1$ denote the class of 1-planar graphs and let $tC_5$ be the disjoint union of $t$ copies of $C_5$. For every fixed $t\ge3$ and all sufficiently large $n$, we determine the unique $n$-vertex $tC_5$-free graph in $\mathcal P_1$ with maximum adjacency spectral radius, answering Problem
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Perfect matching covers of claw-free cubic graphs#1156072
- Generalized Spectral Closedness and the Nonexistence of Walk-Realizable Supporters for Split Graphs#794069
- Generalized Spectral Closedness and the Nonexistence of Walk-Realizable Supporters for Split Graphs#790050
- Almost all graphs are determined by their generalized spectrum#1247974
- Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms#268172
Record · ID 1232927
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive