Bounds on the edge-Wiener index of cacti with n vertices and t cycles

2018/09/04 by Siyan Liu, Rong‐Xia Hao, Liu, Siyan +1
Chemistry · Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Interconnection Networks and Systems #Zeolite Catalysis and Synthesis

paper · pdf · doi:10.48550/arxiv.1809.01128

openalex publication_date 2018/09/04 · openalex created_date 2018/09/27 · openalex updated_date 2026/07/28

Abstract

The edge-Wiener index W_e(G) of a connected graph G is the sum of distances between all pairs of edges of G. A connected graph G is said to be a cactus if each of its blocks is either a cycle or an edge. Let G_n,t denote the class of all cacti with n vertices and t cycles. In this paper, the upper bound and lower bound on the edge-Wiener index of graphs in G_n,t are identified and the corresponding extremal graphs are characterized.

Citations

• On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index

Related

• On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index
• On extremal cacti with respect to the edge revised Szeged index
• Comparing Wiener, Szeged and revised Szeged index on cactus graphs
• Cacti with maximum Kirchhoff index
• On the maximum number of edges of k-cacti