On the largest real root of the independence polynomial of a unicyclic graph
Bibliographic record
Abstract
We find the maximum and minimum connected unicyclic and connected well-covered unicyclic graphs of a given order with respect to ⪯.This extends 2013 work by Csikvári where the maximum and minimum trees of a given order were determined and also answers an open question posed in the same work.Corollaries of our results give the graphs that minimize and maximize ξ(G) among all connected (well-covered) unicyclic graphs.We also answer more related open questions posed by Oboudi in 2018 and disprove a conjecture due to Levit and Mandrescu from 2008.The independence polynomial of a graph G, denoted I(G, x), is the generating polynomial for the number of independent sets of each size.The roots of I(G, x) are called the independence roots of G.It is known that for every graph G, the independence root of smallest modulus, denoted ξ(G), is real.The relation ⪯ on the set of all graphs is defined as follows, H ⪯ G if and only if I(H, x) ≥ I(G, x) for all x ∈ [ξ(G), 0].
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.005 |
| Insufficient payload (model declined to judge) | 0.010 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".