Edge bipartiteness and signless Laplacian spread of graphs
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Let G be a connected graph, and let ?b(G) and SQ(G) be the edge bipartiteness and the signless Laplacian spread of G, respectively. We establish some important relationships between ?b(G) and SQ(G), and prove SQ(G)?2 (1+cos?/n) with equality if and only if G = Pn or G = Cn in case of odd n. In addition, we show that if G?Pn or G?C2k+1; then SQ(G)?4; with equality if and only if G is one of the following graphs: K1,3, K4, two triangles connected by an edge, and Cn for even n. As a consequence, we prove a conjecture of Cvetkovic, Rowlinson and Simic on minimal signless Laplacian spread [Eigenvalue bounds for the signless Laplacian, Publ. Inst. Math. (Beograd), 81(95)(2007), 11-27].
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it