arXiv (All)
open access
Resolution of a problem of Mohar on non-positive inertia
For a graph $G$ of order $n$, its positive, negative and non-positive inertia is the number of positive, negative and non-positive eigenvalues of its adjacency matrix $A(G)$, respectively. Mohar asked whether every graph with $k$ non-positive eigenvalues has order $O(k^2)$ as $k\to \infty$. Using NE
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
- Positive Square Energy of Graphs with Minimum Degree at Least Two#974867
- Beyond Fast Contractions: Attenuation and Recovery of Matrix-Engine Speedups in High-Order Finite Elements#441753
- Huq OD matrices V2#325597
- On the finite group whose proper enhanced power graph is claw-free#620826
- On the finite group whose proper enhanced power graph is claw-free#619147
Record · ID 973902
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