A note on chemical trees with minimum Wiener polarity index

DOI10.1016/j.amc.2018.04.051zbMath1427.05053OpenAlexW2803724393WikidataQ129813526 ScholiaQ129813526MaRDI QIDQ2335577

Yanyan Li

Publication date: 14 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.04.051

zbMATH Keywords

topological indexextremal valueWiener polarity indexchemical treechemical graph theory

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ Distance-based indices of complete m-ary trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Wiener polarity index of trees with maximum degree or given number of leaves
• The Nordhaus-Gaddum-type inequality for the Wiener polarity index
• On the Wiener polarity index of graphs
• On difference of Zagreb indices
• On the sum of squares of degrees and products of adjacent degrees
• The maximum Wiener polarity index of trees with \(k\) pendants
• Ordering chemical trees by Wiener polarity index
• On the generalized Wiener polarity index of trees with a given diameter
• Analyzing lattice networks through substructures
• On the reduced second Zagreb index of trees

This page was built for publication: A note on chemical trees with minimum Wiener polarity index