Wiener Index of Graphs and Their Line Graphs

2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2013 Operations Research Society of China, Periodicals Agency of Shanghai University, and Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Su, X., Wang, L., & Gao, Y. (2013). Wiener Index of Graphs and Their Line Graphs. Journal of the Operations Research Society of China, 1(3), 393–403. https://doi.org/10.1007/s40305-013-0027-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free