On the domination polynomials of friendship 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 simple graph of order n. The domination polynomial of G is the\n polynomial D(G,x)= nΣi=0 d(G,i)xi, where d(G,i) is the number of dominating\n sets of G of size i. Let n be any positive integer and Fn be the Friendship\n graph with 2n + 1 vertices and 3n edges, formed by the join of K1 with nK2.\n We study the domination polynomials of this family of graphs, and in\n particular examine the domination roots of the family, and find the limiting\n curve for the roots. We also show that for every n > 2, Fn is not D-unique,\n that is, there is another non-isomorphic graph with the same domination\n polynomial. Also we construct some families of graphs whose real domination\n roots are only -2 and 0. Finally, we conclude by discussing the domination\n polynomials of a related family of graphs, the n-book graphs Bn, formed by\n joining n copies of the cycle graph C4 with a common edge.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.007 |
| Open science | 0.002 | 0.001 |
| 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