Loading...
Loading...

Go to the content (press return)

On the randic index of graphs

Author
Dalfo, C.
Type of activity
Journal article
Journal
Discrete mathematics
Date of publication
2018-09-11
DOI
https://doi.org/10.1016/j.disc.2018.08.020 Open in new window
Project funding
Combinatorics of networks and computation
Repository
http://hdl.handle.net/2117/126594 Open in new window
URL
https://www.sciencedirect.com/science/article/pii/S0012365X18302784 Open in new window
Abstract
For a given graph G = (V, E), the degree mean rate of an edge uv ¿ E is a half of the quotient between the geometric and arithmetic means of its end-vertex degrees d(u) and d(v). In this note, we derive tight bounds for the Randic index of G in terms of its maximum and minimum degree mean rates over its edges. As a consequence, we prove the known conjecture that the average distance is bounded above by the Randic index for graphs with order n large enough, when the minimum degree d is greater t...
Citation
Dalfo, C. On the randic index of graphs. "Discrete mathematics", 11 Setembre 2018.
Keywords
Connectivity index, Edge degree rate, Mean distance, Randic index
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments