The inverse degree conditions for Hamiltonian and traceable graphs

Let \(G = (V(G), E(G))\) be a graph with minimum degree at least \(1\). The inverse degree of \(G\), denoted \(Id(G)\), is defined as the sum of the reciprocals of degrees of all vertices in \(G\). In this note, we present inverse degree conditions for Hamiltonian and traceable graphs.

Authors

Publication Details

Journal
Open Journal of Discrete Applied Mathematics
Published
2024-12-31
DOI
https://doi.org/10.30538/psrp-odam2024.0098
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The inverse degree conditions for Hamiltonian and traceable graphs

Rao Li
Open Journal of Discrete Applied Mathematics
Graph theory and applications
article

The inverse degree conditions for Hamiltonian and traceable graphs

Rao Li
article en

Abstract

Let \(G = (V(G), E(G))\) be a graph with minimum degree at least \(1\). The inverse degree of \(G\), denoted \(Id(G)\), is defined as the sum of the reciprocals of degrees of all vertices in \(G\). In this note, we present inverse degree conditions for Hamiltonian and traceable graphs.

Open Journal of Discrete Applied MathematicsVol. 7(2)
Openalex Percentile: Top 62%
Graph theory and applications
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The inverse degree conditions for Hamiltonian and traceable graphs — Rao Li · Open Journal of Discrete Applied Mathematics (2024) | TGRS Research Map | TGRS