Computing the Wiener index in Sierpinski carpet graphs

2018/02/27 by Daniele D’Angeli, D'Angeli, Daniele, Alfredo Donno +3
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.1802.09840

openalex created_date 2016/06/24 · openalex publication_date 2018/02/27 · openalex updated_date 2026/07/28

Abstract

We describe an algorithm to compute the Wiener index of a sequence of finite graphs approximating the Sierpinski carpet.

Related

• Complexity to Find Wiener Index of Some Graphs
• Wiener index of graphs with fixed number of pendant or cut vertices
• Wiener index and graphs, almost half of whose vertices satisfy Šoltés property
• On inverse Wiener interval problem of trees
• Wiener index and Steiner 3-Wiener index of a graph