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

Internet

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

Ejemplares similares