On Wiener index of graphs and their line graphs

Abstract : The Wiener index of a graph $G$, denoted by $W(G)$, is the sum of distances between all pairs of vertices in $G$. In this paper, we consider the relation between the Wiener index of a graph, $G$, and its line graph, $L(G)$. We show that if $G$ is of minimum degree at least two, then $W(G) ≤ W(L(G))$. We prove that for every non-negative integer g0, there exists $g > g_0$, such that there are infinitely many graphs $G$ of girth $g$, satisfying $W(G) = W(L(G))$. This partially answers a question raised by Dobrynin and Mel'nikov [8] and encourages us to conjecture that the answer to a stronger form of their question is affirmative.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

Contributor : Nathann Cohen <>
Submitted on : Tuesday, November 2, 2010 - 12:20:24 PM
Last modification on : Friday, March 15, 2019 - 4:55:06 PM
Document(s) archivé(s) le : Friday, December 2, 2016 - 7:30:58 AM


Files produced by the author(s)


  • HAL Id : hal-00531288, version 1



Nathann Cohen, Darko Dimitrov, Roi Krakovski, Riste Skrekovski, Vida Vukašinović. On Wiener index of graphs and their line graphs. MATCH Communications in Mathematical and in Computer Chemistry, 2010, 64 (3), pp.683-698. ⟨hal-00531288⟩



Record views


Files downloads