Ordering chemical trees by Wiener polarity index
From MaRDI portal
Publication:1740052
DOI10.1016/j.amc.2017.06.005zbMath1426.05021OpenAlexW2652250685WikidataQ61987586 ScholiaQ61987586MaRDI QIDQ1740052
Ali Ghalavand, Ali Reza Ashrafi
Publication date: 29 April 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.06.005
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (6)
Towards the solution of an extremal problem concerning the Wiener polarity index of alkanes ⋮ A note on the minimum Wiener polarity index of trees with a given number of vertices and segments or branching vertices ⋮ Formula for calculating the Wiener polarity index with applications to benzenoid graphs and phenylenes ⋮ Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices ⋮ Ordering chemical graphs by Randić and sum-connectivity numbers ⋮ A note on chemical trees with minimum Wiener polarity index
Cites Work
This page was built for publication: Ordering chemical trees by Wiener polarity index