Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the randic index of graphs

Autor
Dalfo, C.
Tipus d'activitat
Article en revista
Revista
Discrete mathematics
Data de publicació
2018-09-11
DOI
https://doi.org/10.1016/j.disc.2018.08.020 Obrir en finestra nova
Projecte finançador
Combinatorics of networks and computation
Repositori
http://hdl.handle.net/2117/126594 Obrir en finestra nova
URL
https://www.sciencedirect.com/science/article/pii/S0012365X18302784 Obrir en finestra nova
Resum
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...
Citació
Dalfo, C. On the randic index of graphs. "Discrete mathematics", 11 Setembre 2018.
Paraules clau
Connectivity index, Edge degree rate, Mean distance, Randic index
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants