Trees preserving Wiener index in two classes of graphs
Ligong Wang
Abstract
Ligong Wang
Abstract
The existence problem on trees preserving the Wiener index of two classes of graphs is studied in this paper.The Wiener index W(G) of a connected graph G is the sum of distances among all pairs of vertices in G.If there is a connected subtree T of a given connected graph G such that W(G)=W(T),then T is called a preserving the Wiener index tree of G.In this paper,the graph S(s,t,l,k,s,t,l) is defined as a multi-fan graph with pendent edges and the graph G(s,t,l,m,k) is defined as a group of multi-fan graphs with pendent edges.By using the definition and the properties of Wiener index of a graph,it is proved that there exist subtrees preserving Wiener index in those two classes of graphs.
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 existence problem on trees preserving the Wiener index of two classes of graphs is studied in this paper.The Wiener index W(G) of a connected graph G is the sum of distances among all pairs of vertices in G.If there is a connected subtree T of a given connected graph G such that W(G)=W(T),then T is called a preserving the Wiener index tree of G.In this paper,the graph S(s,t,l,k,s,t,l) is defined as a multi-fan graph with pendent edges and the graph G(s,t,l,m,k) is defined as a group of multi-fan graphs with pendent edges.By using the definition and the properties of Wiener index of a graph,it is proved that there exist subtrees preserving Wiener index in those two classes of graphs.
Key concepts: Wiener index, Combinatorics, Mathematics, Connectivity, Graph, Topological index, Discrete mathematics