Wiener Index of Graphs and Their Line Graphs

Xiaohai Su, Ligong Wang, Yun Gao

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

The Wiener index W(G) of a graph G is a distance-based topological index defined as the sum of distances between all pairs of vertices in G. It is shown that for λ=2 there is an infinite family of planar bipartite chemical graphs G of girth 4 with the cyclomatic number λ, but their line graphs are not chemical graphs, and for λ≥2 there are two infinite families of planar nonbipartite graphs G of girth 3 with the cyclomatic number λ; the three classes of graphs have the property W(G)=W(L(G)), where L(G) is the line graph of G.

Original languageEnglish
Pages (from-to)393-403
Number of pages11
JournalJournal of the Operations Research Society of China
Volume1
Issue number3
DOIs
StatePublished - Sep 2013

Keywords

  • Cyclomatic number
  • Line graph
  • Wiener index

Fingerprint

Dive into the research topics of 'Wiener Index of Graphs and Their Line Graphs'. Together they form a unique fingerprint.

Cite this