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.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call