Computing the Wiener index in Sierpinski carpet graphs
Daniele D'Angeli, Alfredo Donno, Alessio Monti
TL;DR
This paper presents an algorithm for calculating the Wiener index of finite graphs that approximate the Sierpinski carpet, a fractal structure, enabling analysis of its properties.
Contribution
The paper introduces a novel algorithm specifically designed for efficiently computing the Wiener index of Sierpinski carpet graphs.
Findings
Algorithm successfully computes Wiener index for various graph sizes.
Provides insights into the structural properties of Sierpinski carpet graphs.
Potential applications in fractal analysis and network theory.
Abstract
We describe an algorithm to compute the Wiener index of a sequence of finite graphs approximating the Sierpinski carpet.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Topological and Geometric Data Analysis · Limits and Structures in Graph Theory