Some theoremes about the Randić connectivity index

zbMATH Open1164.05014MaRDI QIDQ3545992FDOQ3545992

Authors: Ryan Pepper, Doug Klein 

Publication date: 18 December 2008

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

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)

Cited In (10)

• Randić connectivity and sum-connectivity indices for Capra-designed of cycles
• Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
• Title not available (Why is that?)
• Sharp bounds for Zagreb indices of maximal outerplanar graphs
• On a novel connectivity index
• On the extremal Zagreb indices of graphs with cut edges
• On the maximum Zagreb indices of graphs with \(k\) cut vertices
• Title not available (Why is that?)
• A recursive formula for the Randić index of a tree
• Zeroth-order general Randić index of cactus graphs

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)