The wiener index of graphs of arbitrary girth and their line graphs
Andrey A. Dobrynin
Abstract
Andrey A. Dobrynin
Abstract
We consider the invariant W ( G ) of a simple connected undirected graph G which is equal to the sum of distances between all pairs of its vertices in the natural metric (the Wiener index). We show that, for every g ≥ 5, there is a planar graph G of girth g satisfying W ( L ( G )) = W ( G ), where L ( G ) is the line graph of G .
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.
We consider the invariant W ( G ) of a simple connected undirected graph G which is equal to the sum of distances between all pairs of its vertices in the natural metric (the Wiener index). We show that, for every g ≥ 5, there is a planar graph G of girth g satisfying W ( L ( G )) = W ( G ), where L ( G ) is the line graph of G .
Key concepts: Mathematics, Combinatorics, Wiener index, Girth (graph theory), Discrete mathematics, Line graph, Graph