An inequality between the edge-Wiener index and the Wiener index of a graph
From MaRDI portal
Publication:668722
DOI10.1016/j.amc.2015.07.050zbMath1410.05049OpenAlexW1781878620MaRDI QIDQ668722
Martin Knor, Riste Škrekovski, Aleksandra Tepeh Horvat
Publication date: 19 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.07.050
Related Items
Gutman index, edge-Wiener index and edge-connectivity ⋮ Generalized cut method for computing the edge-Wiener index ⋮ The edge-Hosoya polynomial of benzenoid chains ⋮ Digraphs with large maximum Wiener index ⋮ Leapfrog fullerenes and Wiener index ⋮ The Szeged index and the Wiener index of partial cubes with applications to chemical graphs ⋮ On a conjecture about the ratio of Wiener index in iterated line graphs ⋮ Graphs preserving Wiener index upon vertex removal
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Q-Wiener index of some compound trees
- The maximum Wiener polarity index of unicyclic graphs
- The edge-Wiener index of a graph
- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- Partial cubes as subdivision graphs and as generalized Petersen graphs
- Relationship between the edge-Wiener index and the Gutman index of a graph
- Wiener index for graphs and their line graphs with arbitrary large cyclomatic numbers
- New distance-based graph invariants and relations among them
- On the sum of all distances in a graph or digraph
- Some results on the Wiener index of iterated line graphs
- Distance in graphs
- Some new results on distance-based graph invariants
- Wiener index of trees: Theory and applications
This page was built for publication: An inequality between the edge-Wiener index and the Wiener index of a graph
