A note on the minimum Wiener polarity index of trees with a given number of vertices and segments or branching vertices

DOI10.1155/2021/1052927zbMath1465.05041OpenAlexW3125699133MaRDI QIDQ2657432

Sadia Noureen, Akbar Ali, Akhlaq Ahmad Bhatti

Publication date: 12 March 2021

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/1052927

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

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
• The maximum Wiener polarity index of trees with \(k\) pendants
• Formula for calculating the Wiener polarity index with applications to benzenoid graphs and phenylenes
• Ordering chemical trees by Wiener polarity index
• Towards the solution of an extremal problem concerning the Wiener polarity index of alkanes
• A note on chemical trees with minimum Wiener polarity index
• Revan and hyper-Revan indices of octahedral and icosahedral networks
• On the reduced second Zagreb index of trees
• (β ,α)−Connectivity Index of Graphs
• Computing topological indices of the line graphs of Banana tree graph and Firecracker graph
• On the Extremal Zagreb Indices of $\mathbf{\textit{n}}$-Vertex Chemical Trees with Fixed Number of Segments or Branching Vertices

This page was built for publication: A note on the minimum Wiener polarity index of trees with a given number of vertices and segments or branching vertices