Metric properties of generalized Sierpiński graphs over stars
From MaRDI portal
Publication:2026318
DOI10.1016/j.dam.2018.07.008zbMath1464.05133OpenAlexW2887881387MaRDI QIDQ2026318
Ehsan Estaji, Yaser Alizadeh, Sandi Klavžar, Marko Petkovsek
Publication date: 19 May 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.07.008
Distance in graphs (05C12) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Related Items
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Resolvability and convexity properties in the Sierpiński product of graphs ⋮ The Graovac-Pisanski index of Sierpiński graphs ⋮ Constructing new families of transmission irregular graphs ⋮ The number of subtrees in graphs with given number of cut edges ⋮ Degree sequence of the generalized Sierpiński graph ⋮ Local metric dimension for graphs with small clique numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the metric dimension of a graph from primary subgraphs
- Comparing the metric and strong dimensions of graphs
- A survey and classification of Sierpiński-type graphs
- Strongly distance-balanced graphs and graph products
- Wiener index of hexagonal systems
- The Szeged index and the Wiener index of partial cubes with applications to chemical graphs
- On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs
- On generalized Sierpiński graphs
- New results on variants of covering codes in Sierpiński graphs
- On the Wiener index, distance cospectrality and transmission-regular graphs
- On maximum Wiener index of trees and graphs with given radius
- Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
- Centralization of transmission in networks
- The Tower of Hanoi – Myths and Maths
- Hitting Times, Cover Cost, and the Wiener Index of a Tree
- Metric bases in digital geometry
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- The metric dimension of the circulant graph $C(n,\pm\{1,2,3,4\})$
- On the roman domination number of generalized Sierpiński graphs
- On distances in generalized Sierpiński graphs
- Connectivity and some other properties of generalized Sierpiński graphs
- Wiener index, Harary index and Hamiltonicity of graphs
- On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
- Metric Dimension of Bounded Tree-length Graphs
- The strong metric dimension of generalized Sierpiński graphs with pendant vertices
- Wiener index of trees: Theory and applications
- Random walks on dual Sierpinski gaskets
