On generalized Sierpiński graphs
From MaRDI portal
Publication:2364078
Abstract: In this paper we obtain closed formulae for several parameters of generalized Sierpi'{n}ski graphs in terms of parameters of the base graph . In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Recommendations
Cites work
- 1-perfect codes in Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Hamming dimension of a graph-the case of Sierpiński graphs
- scientific article; zbMATH DE number 3154393 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- New results on variants of covering codes in Sierpiński graphs
- On distances in Sierpiński graphs: almost-extreme vertices and metric dimension
- On some metric properties of the Sierpiński graphs S(n,k)
- On the corona of two graphs
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
- On the Randić index of polymeric networks modelled by generalized Sierpiński graphs
- The average eccentricity of Sierpiński graphs
- The strong metric dimension of generalized Sierpiński graphs with pendant vertices
- The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
- Total coloring for generalized Sierpiński graphs
Cited in
(30)- Branching on a Sierpinski graph
- Packing coloring of Sierpiński-type graphs
- Constructions of universalized Sierpiński graphs based on labeling manipulations
- Metric properties of generalized Sierpiński graphs over stars
- Strong geodetic problem in networks
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
- Some algebraic properties of Sierpiński-type graphs
- A 2-parametric generalization of Sierpiński gasket graphs.
- scientific article; zbMATH DE number 1993726 (Why is no real title available?)
- Recognizing generalized Sierpiński graphs
- The Sierpiński product of graphs
- On the zero forcing number of generalized Sierpiński graphs
- Degree sequence of the generalized Sierpiński graph
- On distances in generalized Sierpiński graphs
- Connectivity and some other properties of generalized Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- scientific article; zbMATH DE number 5879503 (Why is no real title available?)
- On generalized binomial series and strongly regular graphs
- On generalized shift graphs
- scientific article; zbMATH DE number 5043398 (Why is no real title available?)
- scientific article; zbMATH DE number 7646868 (Why is no real title available?)
- The Sierpiński domination number
- Some properties of the generalized Sierpiński gasket graphs
- Strong domination number of generalized Sierpiński graphs
- Perfect double Italian and double Italian domination on Sierpiński graphs
- On the Sombor index of Sierpiński and Mycielskian graphs
- Secure domination in generalized Sierpiński graphs
- Metric dimensions of generalized Sierpiński graphs over squares
- Girth and planarity of the generalized Sierpiński gasket \(S[G, t]\)
- Total-neighbor-distinguishing coloring by sums of fractals of generalized Sierpiński graphs
This page was built for publication: On generalized Sierpiński graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364078)