MétaCan
Menu
Back to cohort
Record W4394577775 · doi:10.28924/2291-8639-22-2024-63

A Study on Degree Based Topological Indices of Harary Subdivision Graphs With Application

2024· article· en· W4394577775 on OpenAlex

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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Analysis and Applications · 2024
Typearticle
Languageen
FieldMathematics
TopicGraph theory and applications
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsSubdivisionDegree (music)Topology (electrical circuits)Pure mathematicsCombinatoricsGeographyPhysics

Abstract

fetched live from OpenAlex

Combinatorial design theory and graph decompositions play a critical role in the exploration of combinatorial design theory and are essential in mathematical sciences. The process of graph decomposition involves partitioning the set of edges in a graph G. An n-sun graph, characterized by a cycle with an edge connecting each vertex to a terminating vertex of degree one, is introduced in this study. The concept of n-sun decomposition is applied to certain even-order graphs. The indices covered in this study include the general connectivity index of the harary graphs, Zagreb indices, symmetric division degree indices and randic indices.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.203
Threshold uncertainty score0.325

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.044
GPT teacher head0.362
Teacher spread0.319 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it