On reciprocal degree distance of graphs

Mingqiang An, Yinan Zhang, Kinkar Chandra Das*, Yilun Shang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
20 Downloads (Pure)


Given a connected graph , its reciprocal degree distance is defined as where denotes the degree of the vertex in the graph and is the shortest distance between and in . The goal of this paper is to establish some sufficient conditions to judge that a graph to be -hamiltonian, -path-coverable or -edge-hamiltonian by employing the reciprocal degree distance. [Abstract copyright: © 2023 The Authors.]
Original languageEnglish
Article numbere17914
Issue number7
Early online date4 Jul 2023
Publication statusPublished - Jul 2023

Cite this