On generalized Sierpiński graphs
From MaRDI portal
Publication:2364078
DOI10.7151/dmgt.1945zbMath1366.05090arXiv1509.03047OpenAlexW2962740178WikidataQ57974178 ScholiaQ57974178MaRDI QIDQ2364078
Erick David Rodríguez-Bazan, Alejandro Estrada-Moreno, Juan Alberto Rodríguez-Velázquez
Publication date: 17 July 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.03047
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (9)
Packing coloring of Sierpiński-type graphs ⋮ The Sierpiński product of graphs ⋮ On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs ⋮ On distances in generalized Sierpiński graphs ⋮ Connectivity and some other properties of generalized Sierpiński graphs ⋮ Metric properties of generalized Sierpiński graphs over stars ⋮ Strong geodetic problem in networks ⋮ Degree sequence of the generalized Sierpiński graph ⋮ Recognizing generalized Sierpiński graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- Hamming dimension of a graph-the case of Sierpiński graphs
- The average eccentricity of Sierpiński graphs
- New results on variants of covering codes in Sierpiński graphs
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
- On the corona of two 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 distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
- The strong metric dimension of generalized Sierpiński graphs with pendant vertices
This page was built for publication: On generalized Sierpiński graphs