arXiv (All)
open access
Spectral extremal problems on 1-planar graphs without Friendship graph
Let $\textit{spex}_{\mathcal{P}_1}(n,F)$ be the maximum spectral radius among all $n$-vertex $F$-free $1$-planar graphs. Define $F_t$ as the friendship graph formed by $t$ triangles sharing exactly one common vertex. Tait and Tobin (2017)~\cite{Tait2017} used the fundamental structure of spectral ex
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
- On a conjecture of Nikiforov concerning the minimal $p$-energy of connected graphs#793400
- On a conjecture of Nikiforov concerning the minimal $p$-energy of connected graphs#789396
- Finiteness and exponential growth of full graph $p$-spectra#1034059
- Generalized regular Turán numbers#785030
- Generalized regular Turán numbers#783440
Record · ID 1217180
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