arXiv (All)
open access
A sharp bound for the least signless Laplacian eigenvalue of triangle-free graphs
We prove that every finite simple triangle-free graph $G$ on $n\geq1$ vertices satisfies $q_{\min}(G)\leq7n/50$, where $q_{\min}(G)$ is the least eigenvalue of its signless Laplacian matrix $Q_G=D_G+A_G$, with $D_G$ the diagonal matrix of vertex degrees and $A_G$ the adjacency matrix. The constant i
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
- Maximization of the first Laplace eigenvalue of a finite graph II#971672
- Schur positivity from signed elementary expansions: clique-spiders and spiders $S(a,b,2)$#1326388
- The edge spectral extremal problem for $kK_3$ in nonzero residue classes#1216397
- Higher $q$-Continued Fractions and Dimers on Band Graphs#625529
- Higher $q$-Continued Fractions and Dimers on Band Graphs#623256
Record · ID 1325399
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