Abstract
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 language | English |
---|---|
Article number | e17914 |
Journal | Heliyon |
Volume | 9 |
Issue number | 7 |
Early online date | 4 Jul 2023 |
DOIs | |
Publication status | Published - Jul 2023 |
Keywords
- ħ-path-coverable
- ħ-hamiltonian
- ħ-edge-hamiltonian
- Reciprocal degree distance