The Wiener Index of a Class of Chemical Graphs and Their Line Graphs
Hanyuan Deng
Abstract
Hanyuan Deng
Abstract
The Wiener index W (G) of a graph G= (V, E) is a distance-based topological index defined as the sum of distances between all pairs of vertices in G. For any integer n, an infinite family of planar and bipartite chemical graphs with cyclomatic number two are constructed such that their line graphs are also chemical graphs, and the difference of the Wiener indices between the graphs and their line graphs is n. This affirms partly an open problem proposed by A. D. Dobrynin and L. S. Mel'nikov.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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= (V, E) is a distance-based topological index defined as the sum of distances between all pairs of vertices in G. For any integer n, an infinite family of planar and bipartite chemical graphs with cyclomatic number two are constructed such that their line graphs are also chemical graphs, and the difference of the Wiener indices between the graphs and their line graphs is n. This affirms partly an open problem proposed by A. D. Dobrynin and L. S. Mel'nikov.
Key concepts: Wiener index, Combinatorics, Mathematics, Bipartite graph, Indifference graph, Chordal graph, 1-planar graph, Topological index