Extremal chemical (n,m,k)-graphs with maximum Randić index

MaRDI QIDQ3643752zbMATHFDO

Authors Huiqing Liu, Zheng Yan, Heguo Liu

Publication date 9 November 2009

zbMATH Keywords

vertex degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Extremal values of Randić index among some classes of graphs
• Maximum Randić index on trees with \(k\)-pendant vertices
• Properties of chemical trees with \(k\) pendant vertices and maximal Randić index
• Properties of the extremal Randić index trees with \(k\)-pendant vertices
• The maximum Randić index of chemical trees with \(k\) pendants

Cited in

(10)

• On Extremal Sombor Indices of Chemical Graphs, and Beyond
• Maximum and second maximum of Randić index in the class of tricyclic graphs
• On topological properties of hierarchical interconnection networks
• Properties of the extremal Randić index trees with \(k\)-pendant vertices
• The maximum Randić index of chemical trees with \(k\) pendants
• On the modified Randić index of graphs with \(k\) pendent vertices
• scientific article; zbMATH DE number 86102 (Why is no real title available?)
• scientific article; zbMATH DE number 2239311 (Why is no real title available?)
• Extremal Sombor Indices of Tetracyclic (Chemical) Graphs
• Extremal values of Randić index among some classes of graphs

This page was built for publication: Extremal chemical \((n,m,k)\)-graphs with maximum Randić index

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