Some theoremes about the Randić connectivity index

MaRDI QIDQ3545992zbMATH OpenFDO

Authors Ryan Pepper, Doug Klein

Publication date 18 December 2008

zbMATH Keywords

Randic indexbenzenoidschemical graphsRandic connectivity index

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• scientific article; zbMATH DE number 1874441
• On the Randić index
• A recursive formula for the Randić index of a tree
• Ordering chemical graphs by Randić and sum-connectivity numbers
• scientific article; zbMATH DE number 1904845

Cited in

(12)

• Randić connectivity and sum-connectivity indices for Capra-designed of cycles
• scientific article; zbMATH DE number 1904845 (Why is no real title available?)
• On the extremal Zagreb indices of graphs with cut edges
• Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
• On the maximum Zagreb indices of graphs with \(k\) cut vertices
• scientific article; zbMATH DE number 1874441 (Why is no real title available?)
• Sharp bounds for Zagreb indices of maximal outerplanar graphs
• A recursive formula for the Randić index of a tree
• Zeroth-order general Randić index of cactus graphs
• Ordering chemical graphs by Randić and sum-connectivity numbers
• On the Randic and sum-connectivity index of nanotubes
• On a novel connectivity index

This page was built for publication: Some theoremes about the Randić connectivity index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545992)