arXiv (All)
open access
Turán-type extremal problems for unbalanced signed graphs
In this paper, we establish two Turán-type results for signed graphs. We first generalize the classical Turán theorem to signed graphs and then extend Nikiforov's spectral Turán theorem to signed graphs. Moreover, we determine the second maximum spectral radius among all unbalanced signed graphs tha
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
- The tree packing conjecture for trees of almost linear maximum degree#986755
- Nonexistence of a Strongly Regular Graph with Parameters (266,45,0,9): A Certificate-Free Lean Proof#985683
- An infeasible interior-point algorithm for solving primal and dual geometric programs#429971
- Havel--Hakimi Residues of Common-Divisor Graphs: Complete Asymptotics and Prime-Counting Structure#800125
- Some applications of graph theory to number theory#490192
Record · ID 1011899
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