Ligong Wang
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 λ≥7or 9 there are two classes of graphs with the cyclomatic number λ satisfying the property W(G)=W(L(G)),where L(G) is the line graph of G.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 λ≥7or 9 there are two classes of graphs with the cyclomatic number λ satisfying the property W(G)=W(L(G)),where L(G) is the line graph of G.
Key concepts: Wiener index, Combinatorics, Line graph, Mathematics, Graph, Discrete mathematics, Topological index, Bound graph