Randić index and the diameter of a graph

DOI10.1016/j.ejc.2010.12.002zbMath1213.05157OpenAlexW2012813674MaRDI QIDQ627931

Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski

Publication date: 4 March 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2010.12.002

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (14)

Upper bound for DP-chromatic number of a graph ⋮ Note on two generalizations of the Randić index ⋮ Sharp bounds for the Randić index of graphs with given minimum and maximum degree ⋮ Fast algorithms for indices of nested split graphs approximating real complex networks ⋮ Some tight bounds for the harmonic index and the variation of the Randić index of graphs ⋮ A lower bound on the modified Randić index of line graphs ⋮ The Randić index and signless Laplacian spectral radius of graphs ⋮ Sandwiching the (generalized) Randić index ⋮ Extremal values for the variation of the Randić index of bicyclic graphs ⋮ The variation of the Randić index with regard to minimum and maximum degree ⋮ Upper bounds for the achromatic and coloring numbers of a graph ⋮ Zeroth-order general Randić index of cactus graphs ⋮ Extremal benzenoid systems for two modified versions of the Randić index ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds

Uses Software

• AutoGraphiX
• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On conjectures of Graffiti
• On a conjecture of the Randić index
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system

This page was built for publication: Randić index and the diameter of a graph