The trees on n 9 vertices with the first to seventeenth greatest Wiener indices are chemical trees

zbMATH Open1150.05007MaRDI QIDQ5450438FDOQ5450438

Hanyuan Deng

Publication date: 20 March 2008

Recommendations

• Ordering trees by their Wiener indices
• Trees with the greatest Wiener and edge-Wiener index
• Wiener index versus maximum degree in trees
• Trees with extremal Wiener indices
• On the Wiener index of trees with given number of branching vertices

zbMATH Keywords

Wiener indexchemical treesbranching point

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Cited In (15)

• Selected topics on Wiener index
• Trees with the seven smallest and eight greatest Harary indices
• Title not available (Why is that?)
• On the Wiener index of graphs
• On the ordering of distance-based invariants of graphs
• On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index
• On the variable Wiener indices of trees with given maximum degree
• On the \(k\)th smallest and \(k\)th greatest modified Wiener indices of trees
• Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
• On the edge-Szeged index of unicyclic graphs with perfect matchings
• Wiener indices of spiro and polyphenyl hexagonal chains
• Title not available (Why is that?)
• On extremal cacti with respect to the revised Szeged index
• Ordering trees with given matching number by their Wiener indices
• On extremal cacti with respect to the Szeged index

This page was built for publication: The trees on \(n\geq 9\) vertices with the first to seventeenth greatest Wiener indices are chemical trees

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