Degree sequence of the generalized Sierpiński graph
From MaRDI portal
Publication:5149418
DOI10.11575/cdm.v15i3.68174zbMath1454.05024arXiv1901.06533OpenAlexW3123573516MaRDI QIDQ5149418
Mahsa Khatibi, Fatemeh Attarzadeh, Ali Behtoei
Publication date: 11 February 2021
Full work available at URL: https://arxiv.org/abs/1901.06533
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Coloring Hanoi and Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- On \(p\)-Kostka numbers and Young modules.
- The hub number of Sierpiński-like graphs
- Hamming dimension of a graph-the case of Sierpiński graphs
- Spectral analysis on infinite Sierpiński gaskets
- The Wiener index of Sierpiński-like graphs
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- Metric properties of generalized Sierpiński graphs over stars
- On generalized Sierpiński graphs
- New results on variants of covering codes in Sierpiński graphs
- On topological properties of Sierpinski networks
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
- The Tower of Hanoi – Myths and Maths
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- 1-perfect codes in Sierpiński graphs
- On the roman domination number of generalized Sierpiński graphs
- Connectivity and some other properties of generalized Sierpiński graphs
- The star sequence and the general first Zagreb index
- The strong metric dimension of generalized Sierpiński graphs with pendant vertices
- Crossing numbers of Sierpiński‐like graphs
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
This page was built for publication: Degree sequence of the generalized Sierpiński graph
