Properties of chemical trees with k pendant vertices and maximal Randić index

zbMATH Open1174.05020MaRDI QIDQ5319151FDOQ5319151

Authors: Xiaoxia Xu, Lianzhu Zhang 

Publication date: 22 July 2009

Recommendations

• Properties of the extremal Randić index trees with \(k\)-pendant vertices
• Maximum Randić index on trees with \(k\)-pendant vertices
• The maximum Randić index of chemical trees with \(k\) pendants
• Small Randić index ordering of trees with \(k\) pendant vertices.
• scientific article; zbMATH DE number 5656414

zbMATH Keywords

chemical treeRandić index\(k\)-degree pendant chain

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cited In (10)

• Maximum Randić index on trees with \(k\)-pendant vertices
• Small Randić index ordering of trees with \(k\) pendant vertices.
• Which generalized Randić indices are suitable measures of branching
• Properties of the extremal Randić index trees with \(k\)-pendant vertices
• Randić ordering of chemical trees
• Which generalized Randić indices are suitable measures of molecular branching?
• Title not available (Why is that?)
• Title not available (Why is that?)
• The maximum Randić index of chemical trees with \(k\) pendants
• Extremal chemical \((n,m,k)\)-graphs with maximum Randić index

This page was built for publication: Properties of chemical trees with \(k\) pendant vertices and maximal Randić index

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