arXiv (OAI Expanded)
open access
Characterization of graphs attaining the maximum signless Laplacian spectral radius under forbidden cycles and theta graphs
Spectral Turán-type problems ask how the absence of prescribed subgraphs constrains the spectral radius of a matrix associated with a graph. Given a family of graphs $\mathcal{F}$, a graph is called $\mathcal{F}$-free if it contains no member of $\mathcal{F}$ as a subgraph. The theta graph $θ(l_1,\l
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
- Fast Spectral Signing for Vector Balancing#1078115
- Exact Recovery by Neighborhood Smoothing in Directed Stochastic Block Models#1083019
- Mutual visibility in Moore graphs and $(d,2)$-graphs with defect#665565
- Mutual visibility in Moore graphs and $(d,2)$-graphs with defect#664065
- Directed Hamiltonian-Cycle Parity in $O^*((3/2)^n)$ Deterministic Time and Polynomial Space#1149444
Record · ID 1123541
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