No Detail Found!

On the Wiener index of two families generated by joining a graph to a tree

Author(s)
Andrey A. Dobrynin Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences,Novosibirsk, 630090,Russia
Abstract
The Wiener index W (G) of a graph G is the sum of distances between all vertices of G. The Wiener index of a family of connected graphs is defined as the sum of the Wiener indices of its members. Two families of graphs can be constructed by identifying a fixed vertex of an arbitrary graph F with vertices or subdivision vertices of an arbitrary tree T of order n. Let Gv be a graph obtained by identifying a fixed vertex of F with a vertex v of T . The first family V = fGv j v 2 V (T )g contains n graphs. Denote by Gve a graph obtained by identifying the same fixed vertex of F with the subdivision vertex ve of an edge e in T . The second family E = fGve j e 2 E(T )g contains n 1 graphs. It is proved that W (V) = W (E) if and only if W (F ) = 2W (T ).
Publication Details
Page(s) 44-48
Published Journal: Discrete Mathematics Letters, Volume: 9, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
Wiener index, distance in graphs, graph invariant
0

Citations

0

Downloads

64

Views