On reciprocal degree distance of graphs

Mingqiang An; Yinan Zhang; Kinkar Chandra Das; Yilun Shang

doi:10.1016/j.heliyon.2023.e17914

On reciprocal degree distance of graphs

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

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

Given a connected graph H, its reciprocal degree distance is defined as [Formula presented] where d_H(v_x) denotes the degree of the vertex v_x in the graph H and d_H(v_x,v_y) is the shortest distance between v_x and v_y in H. 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.

Original language	English
Article number	e17914
Journal	Heliyon
Volume	9
Issue number	7
DOIs	https://doi.org/10.1016/j.heliyon.2023.e17914
State	Published - Jul 2023

Keywords

Reciprocal degree distance
ħ-edge-hamiltonian
ħ-hamiltonian
ħ-path-coverable

Access to Document

10.1016/j.heliyon.2023.e17914

Cite this

@article{83f01cace9324afca5c30ae95b3b90a3,

title = "On reciprocal degree distance of graphs",

abstract = "Given a connected graph H, its reciprocal degree distance is defined as [Formula presented] where dH(vx) denotes the degree of the vertex vx in the graph H and dH(vx,vy) is the shortest distance between vx and vy in H. 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.",

keywords = "Reciprocal degree distance, ħ-edge-hamiltonian, ħ-hamiltonian, ħ-path-coverable",

author = "Mingqiang An and Yinan Zhang and Das, \{Kinkar Chandra\} and Yilun Shang",

note = "Publisher Copyright: {\textcopyright} 2023 The Authors",

year = "2023",

month = jul,

doi = "10.1016/j.heliyon.2023.e17914",

language = "English",

volume = "9",

journal = "Heliyon",

issn = "2405-8440",

number = "7",

}

TY - JOUR

T1 - On reciprocal degree distance of graphs

AU - An, Mingqiang

AU - Zhang, Yinan

AU - Das, Kinkar Chandra

AU - Shang, Yilun

PY - 2023/7

Y1 - 2023/7

N2 - Given a connected graph H, its reciprocal degree distance is defined as [Formula presented] where dH(vx) denotes the degree of the vertex vx in the graph H and dH(vx,vy) is the shortest distance between vx and vy in H. 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.

AB - Given a connected graph H, its reciprocal degree distance is defined as [Formula presented] where dH(vx) denotes the degree of the vertex vx in the graph H and dH(vx,vy) is the shortest distance between vx and vy in H. 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.

KW - Reciprocal degree distance

KW - ħ-edge-hamiltonian

KW - ħ-hamiltonian

KW - ħ-path-coverable

UR - https://www.scopus.com/pages/publications/85165250950

U2 - 10.1016/j.heliyon.2023.e17914

DO - 10.1016/j.heliyon.2023.e17914

M3 - Article

AN - SCOPUS:85165250950

SN - 2405-8440

VL - 9

JO - Heliyon

JF - Heliyon

IS - 7

M1 - e17914

ER -

On reciprocal degree distance of graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this