Generalizations of Wiener polarity index and terminal Wiener index
From MaRDI portal
Publication:367047
DOI10.1007/S00373-012-1215-6zbMATH Open1272.05039arXiv1106.2986OpenAlexW2089482534MaRDI QIDQ367047FDOQ367047
Authors: Aleksandar Ilić, Milovan Ilić
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. We introduce a generalized Wiener polarity index as the number of unordered pairs of vertices of such that the shortest distance between and is (this is actually the -th coefficient in the Wiener polynomial). For , we get standard Wiener polarity index. Furthermore, we generalize the terminal Wiener index as the sum of distances between all pairs of vertices of degree . For , we get standard terminal Wiener index. In this paper we describe a linear time algorithm for computing these indices for trees and partial cubes, and characterize extremal trees maximizing the generalized Wiener polarity index and generalized terminal Wiener index among all trees of given order .
Full work available at URL: https://arxiv.org/abs/1106.2986
Recommendations
- scientific article; zbMATH DE number 6127688
- A survey on the Wiener polarity index
- Extension of the Wiener index and Wiener polynomial
- scientific article; zbMATH DE number 6756170
- Wiener polarity index and its generalization in trees
- The Nordhaus-Gaddum-type inequality for the Wiener polarity index
- On extensions of Wiener index
- scientific article; zbMATH DE number 6161923
- On the Wiener polarity index of graphs
- Further properties of reverse Wiener index
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Wiener index of trees: Theory and applications
- Isometric embedding in products of complete graphs
- Wiener number of vertex-weighted graphs and a chemical application
- A bird's eye view of the cut method and a survey of its applications in chemical graph theory
- Title not available (Why is that?)
- On some counting polynomials in chemistry
- The edge-Wiener index of a graph
- On the extremal Wiener polarity index of trees with a given diameter
- Algorithms and extremal problem on Wiener polarity index
- On the extremal Wiener polarity index of chemical trees
- Title not available (Why is that?)
- Equiseparability on Terminal Wiener Index
- On comparing Zagreb indices
- Calculating the degree distance of partial Hamming graphs
- The sum of the distances between the leaves of a tree and the `semi-regular' property
- On the Wiener polarity index of trees with maximum degree or given number of leaves
- Terminal Wiener index
- The maximum Wiener polarity index of trees with \(k\) pendants
Cited In (13)
- Extremal trees of terminal Wiener index
- Counterexamples to conjectures on graph distance measures based on topological indexes
- On the generalized Wiener polarity index of trees with a given diameter
- Hyper-Wiener and Wiener polarity indices of silicate and oxide frameworks
- The vertex version of weighted Wiener number for bicyclic molecular structures
- Molecular structure descriptors for Volkmann trees
- Formula for calculating the Wiener polarity index with applications to benzenoid graphs and phenylenes
- Title not available (Why is that?)
- Computing distance moments on graphs with transitive Djoković-Winkler relation
- Wiener index via wirelength of an embedding
- Partition distance in graphs
- On the distance based graph entropies
- Distance-based topological indices of the tree-like polyphenyl systems
This page was built for publication: Generalizations of Wiener polarity index and terminal Wiener index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367047)