arXiv (All)
open access
A Vertex-Localized Positive Square-Energy Strengthening of Turán's Theorem
Let $G$ be a graph of order $n$ with the adjacency eigenvalues $λ_1(G) \geq \dots \geq λ_n(G) $. Let $c(v)$ denote the maximum order of a clique containing vertex $v$. We prove the vertex-localized positive square-energy inequality \[ \sqrt{s_+(G)} \leq \sum_{v\in V}\left(1-\frac1{c(v)}\right)
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
- A Huppert-type $ρ^*$--$σ^*$ theorem for sub-class sizes#1077589
- Settling the total domination-annihilation conjecture for graphs with minimum degree two#1069947
- Paths maximize the expected range of graph-indexed random walks#1014316
- Proof of a conjecture on graph polytope#131248
- A finite cover for coefficient positivity of stretched Littlewood-Richardson polynomials in the seven-row, size-thirty box#1083802
Record · ID 974570
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