Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
From MaRDI portal
Publication:2441614
DOI10.1016/j.ejc.2013.04.008zbMath1284.05118OpenAlexW2150934784MaRDI QIDQ2441614
Mohammad Javad Nadjafi-Arani, Sandi Klavžar
Publication date: 25 March 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.04.008
Related Items
The Steiner Wiener index of a graph ⋮ Wiener index in graphs with given minimum degree and maximum degree ⋮ On the extreme eccentric distance sum of graphs with some given parameters ⋮ The maximum Wiener index of maximal planar graphs ⋮ Computing distance moments on graphs with transitive Djoković-Winkler relation ⋮ Computing the Mostar index in networks with applications to molecular graphs ⋮ On a novel eccentricity-based invariant of a graph ⋮ The Graovac-Pisanski index of zig-zag tubulenes and the generalized cut method ⋮ On maximum Wiener index of trees and graphs with given radius ⋮ Generalized cut method for computing the edge-Wiener index ⋮ Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs ⋮ Further results on the Merrifield-Simmons index ⋮ Comparative results and bounds for the eccentric-adjacency index ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ Partition distance in graphs ⋮ Improved bounds on the difference between the Szeged index and the Wiener index of graphs ⋮ Distance-based topological indices of nanosheets, nanotubes and nanotori of SiO\(_2\) ⋮ Sum of weighted distances in trees ⋮ Resistance distance-based graph invariants of subdivisions and triangulations of graphs ⋮ On the peripheral Wiener index of graphs ⋮ The Szeged index and the Wiener index of partial cubes with applications to chemical graphs ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ ON WIENER INDEX OF GRAPH COMPLEMENTS ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree ⋮ General transmission lemma and Wiener complexity of triangular grids ⋮ On the Wiener index of generalized Fibonacci cubes and Lucas cubes ⋮ On the minimum eccentric distance sum of bipartite graphs with some given parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Calculating the edge Wiener and edge Szeged indices of graphs
- On the differences between Szeged and Wiener indices of graphs
- Average distance in weighted graphs
- Isometric embedding in products of complete graphs
- The edge-Wiener index of a graph
- Netlike partial cubes, V: completion and netlike classes
- Wiener number of vertex-weighted graphs and a chemical application
- Wiener index of hexagonal systems
- Graphs whose Szeged and Wiener numbers differ by 4 and 5
- Wiener index versus Szeged index in networks
- Distance-preserving subgraphs of hypercubes
- On the canonical metric representation, average distance, and partial Hamming graphs
- On Isometric Embeddings of Graphs
- Some new results on distance-based graph invariants
- Wiener index of trees: Theory and applications
