Molecular graphs and the inverse Wiener index problem

DOI10.1016/j.dam.2008.06.008zbMath1163.92044OpenAlexW2113418935MaRDI QIDQ1028127

Hua Wang, Gang Yu, Stephan G. Wagner

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.008

zbMATH Keywords

Hardy-Littlewood methodsum of squares

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (10)

The maximum Wiener index of maximal planar graphs ⋮ Maximum size of digraphs with some parameters ⋮ The reduced Sombor index and the exponential reduced Sombor index of a molecular tree ⋮ Inverse problem on the Steiner Wiener index ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts ⋮ On Wiener inverse interval problem of trees ⋮ Independent sets in graphs ⋮ The inverse problem for certain tree parameters ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations

Uses Software

• OCOTILLO

Cites Work

• A class of trees and its Wiener index
• All but 49 numbers are Wiener indices of trees
• On a Conjecture on Wiener Indices in Combinatorial Chemistry
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Molecular graphs and the inverse Wiener index problem