Relationship between edge Szeged and edge Wiener indices of graphs
DOI10.3336/GM.47.1.02zbMATH Open1245.05039OpenAlexW2313075118WikidataQ61987620 ScholiaQ61987620MaRDI QIDQ2901981FDOQ2901981
Authors: A. R. Ashrafi, Mohammad Javad Nadjafi-Arani, Hasan Khodashenas 
Publication date: 1 August 2012
Published in: Glasnik Matematički. Serija III (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3336/gm.47.1.02
Recommendations
- On the differences between Szeged and Wiener indices of graphs
- An inequality between the edge-Wiener index and the Wiener index of a graph
- scientific article; zbMATH DE number 1548995
- Comparison between Szeged indices of graphs
- Comparison between the Szeged index and the eccentric connectivity index
Trees (05C05) Exact enumeration problems, generating functions (05A15) Distance in graphs (05C12) Combinatorial inequalities (05A20)
Cited In (10)
- The edge-Wiener index and the edge-hyper-Wiener index of phenylenes
- Gutman index, edge-Wiener index and edge-connectivity
- On the edge-Wiener index of the disjunctive product of simple graphs
- On the differences between Szeged and Wiener indices of graphs
- Edge-Wiener indices of composite graphs
- A new proof of the Szeged-Wiener theorem
- Graphs whose Szeged and Wiener numbers differ by 4 and 5
- The Gutman index and the edge-Wiener index of graphs with given vertex-connectivity
- On the edge-Szeged index of unicyclic graphs with perfect matchings
- Comparison between the Szeged index and the eccentric connectivity index
This page was built for publication: Relationship between edge Szeged and edge Wiener indices of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901981)
