MétaCan
Menu
Back to cohort
Record W7117414515 · doi:10.61091/um125-05

The Gutman-Milovanović index and some Hamiltonian properties of a graph

2025· article· W7117414515 on OpenAlexvenueno aff
Dept. of Computer Science, Engineering and Math, University of South Carolina Aiken, Aiken, SC 29801, USA

Bibliographic record

VenueUtilitas Mathematica · 2025
Typearticle
Language
FieldMathematics
TopicGraph theory and applications
Canadian institutionsnot available
Fundersnot available
KeywordsGraphHamiltonian (control theory)Graph propertyQuartic graphTopological indexUpper and lower boundsHamiltonian pathHamiltonian path problem

Abstract

fetched live from OpenAlex

Let \(G = (V, E)\) be a graph. The Gutman-Milovanović index of a graph \(G\) is defined as \(\sum\limits_{uv \in E} (d(u) d(v))^{\alpha}(d(u) + d(v))^{\beta}\), where \(\alpha\) and \(\beta\) are any real numbers and \(d(u)\) and \(d(v)\) are the degrees of vertices \(u\) and \(v\) in \(G\), respectively. In this note, we present sufficient conditions based on the Gutman-Milovanović index with \(\alpha > 0\) and \(\beta >0\) for some Hamiltonian properties of a graph. We also present upper bounds for the Gutman-Milovanović index of a graph for different ranges of \(\alpha\) and \(\beta\).

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.011
Threshold uncertainty score0.038

Distilled classifier scores by category (both heads)

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

Opus teacher head0.025
GPT teacher head0.275
Teacher spread0.250 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueUtilitas MathematicaSame topicGraph theory and applicationsFrench-language works237,207