Randić index and the diameter of a graph
From MaRDI portal
Publication:627931
DOI10.1016/J.EJC.2010.12.002zbMATH Open1213.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
Cites Work
Cited In (18)
- Title not available (Why is that?)
- The Randić index and signless Laplacian spectral radius of graphs
- Vertex-degree-based topological indices of arbitrary sets of hexagons in the regular hexagonal grid
- A lower bound on the modified Randić index of line graphs
- Note on two generalizations of the Randić index
- Sharp bounds for the Randić index of graphs with given minimum and maximum degree
- The variation of the Randić index with regard to minimum and maximum degree
- Randić index and eigenvalues of graphs
- Upper bound for DP-chromatic number of a graph
- Extremal benzenoid systems for two modified versions of the Randić index
- Fast algorithms for indices of nested split graphs approximating real complex networks
- Bounds on the fault-diameter of graphs
- Sandwiching the (generalized) Randić index
- Extremal values for the variation of the Randić index of bicyclic graphs
- Zeroth-order general Randić index of cactus graphs
- Some tight bounds for the harmonic index and the variation of the Randić index of graphs
- Upper bounds for the achromatic and coloring numbers of a graph
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
Uses Software
This page was built for publication: Randić index and the diameter of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627931)
