Algorithms and extremal problem on Wiener polarity index
From MaRDI portal
Publication:3655079
Recommendations
- An algorithm on the Wiener polarity index of bipartite graphs
- On the extremal Wiener polarity index of chemical trees
- Wiener polarity index and its generalization in trees
- On the Wiener polarity index of trees with maximum degree or given number of leaves
- scientific article; zbMATH DE number 6127688
Cited in
(36)- Ordering chemical trees by Wiener polarity index
- The Szeged index and the Wiener index of partial cubes with applications to chemical graphs
- The number of independent sets in a connected graph and its complement
- An algorithm on the Wiener polarity index of bipartite graphs
- A note on chemical trees with minimum Wiener polarity index
- On minimum Wiener polarity index of unicyclic graphs with prescribed maximum degree
- On the generalized Wiener polarity index of trees with a given diameter
- On the tree with diameter 4 and maximal energy
- Hyper-Wiener and Wiener polarity indices of silicate and oxide frameworks
- On reduced second Zagreb index
- On some algorithms for computing topological indices of chemical graphs
- Generalizations of Wiener polarity index and terminal Wiener index
- Wiener polarity index of fullerenes and hexagonal systems
- Wiener polarity index of cycle-block graphs
- Analyzing lattice networks through substructures
- A note on the minimum Wiener polarity index of trees with a given number of vertices and segments or branching vertices
- The maximum Wiener polarity index of unicyclic graphs
- Degree-based entropies of networks revisited
- On the reduced second Zagreb index of trees
- Towards the solution of an extremal problem concerning the Wiener polarity index of alkanes
- On the extremal Wiener polarity index of Hückel graphs
- Relationships between some distance-based topological indices
- On Zagreb indices, Zagreb polynomials of some nanostar dendrimers
- Wiener polarity index of dendrimers
- On the Wiener polarity index of trees with maximum degree or given number of leaves
- On the Wiener polarity index of graphs
- The Nordhaus-Gaddum-type inequality for the Wiener polarity index
- Further results on the Merrifield-Simmons index
- Bounds for the sum-Balaban index and (revised) Szeged index of regular graphs
- Explicit relation between the Wiener index and the edge-Wiener index of the catacondensed hexagonal systems
- An inequality between the edge-Wiener index and the Wiener index of a graph
- Combination of distance and symmetry in some molecular graphs
- Distance-based topological indices of the tree-like polyphenyl systems
- Relations between distance-based and degree-based topological indices
- Open quipus with the same Wiener index as their quadratic line graph
- The maximum Wiener polarity index of trees with \(k\) pendants
This page was built for publication: Algorithms and extremal problem on Wiener polarity index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655079)