On reciprocal degree distance of graphs

Given a connected graph H, its reciprocal degree distance is defined as [Formula: see text] where [Formula: see text] denotes the degree of the vertex [Formula: see text] in the graph H and [Formula: see text] is the shortest distance between [Formula: see text] and [Formula: see text] in H. The goa...

Descripción completa

Detalles Bibliográficos
Autores principales: An, Mingqiang, Zhang, Yinan, Das, Kinkar Chandra, Shang, Yilun
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2023
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10344745/
https://www.ncbi.nlm.nih.gov/pubmed/37456006
http://dx.doi.org/10.1016/j.heliyon.2023.e17914
_version_ 1785072927269453824
author An, Mingqiang
Zhang, Yinan
Das, Kinkar Chandra
Shang, Yilun
author_facet An, Mingqiang
Zhang, Yinan
Das, Kinkar Chandra
Shang, Yilun
author_sort An, Mingqiang
collection PubMed
description Given a connected graph H, its reciprocal degree distance is defined as [Formula: see text] where [Formula: see text] denotes the degree of the vertex [Formula: see text] in the graph H and [Formula: see text] is the shortest distance between [Formula: see text] and [Formula: see text] 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.
format Online
Article
Text
id pubmed-10344745
institution National Center for Biotechnology Information
language English
publishDate 2023
publisher Elsevier
record_format MEDLINE/PubMed
spelling pubmed-103447452023-07-15 On reciprocal degree distance of graphs An, Mingqiang Zhang, Yinan Das, Kinkar Chandra Shang, Yilun Heliyon Research Article Given a connected graph H, its reciprocal degree distance is defined as [Formula: see text] where [Formula: see text] denotes the degree of the vertex [Formula: see text] in the graph H and [Formula: see text] is the shortest distance between [Formula: see text] and [Formula: see text] 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. Elsevier 2023-07-04 /pmc/articles/PMC10344745/ /pubmed/37456006 http://dx.doi.org/10.1016/j.heliyon.2023.e17914 Text en © 2023 The Authors https://creativecommons.org/licenses/by/4.0/This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Research Article
An, Mingqiang
Zhang, Yinan
Das, Kinkar Chandra
Shang, Yilun
On reciprocal degree distance of graphs
title On reciprocal degree distance of graphs
title_full On reciprocal degree distance of graphs
title_fullStr On reciprocal degree distance of graphs
title_full_unstemmed On reciprocal degree distance of graphs
title_short On reciprocal degree distance of graphs
title_sort on reciprocal degree distance of graphs
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10344745/
https://www.ncbi.nlm.nih.gov/pubmed/37456006
http://dx.doi.org/10.1016/j.heliyon.2023.e17914
work_keys_str_mv AT anmingqiang onreciprocaldegreedistanceofgraphs
AT zhangyinan onreciprocaldegreedistanceofgraphs
AT daskinkarchandra onreciprocaldegreedistanceofgraphs
AT shangyilun onreciprocaldegreedistanceofgraphs

Ejemplares similares