The Sierpiński domination number
From MaRDI portal
Publication:6617234
DOI10.26493/1855-3974.2892.f07zbMATH Open1548.05254MaRDI QIDQ6617234
Sandi Klavžar, Michael A. Henning, Monika Pilśniak, Elżbieta Kleszcz
Publication date: 10 October 2024
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- A survey and classification of Sierpiński-type graphs
- Packing coloring of Sierpiński-type graphs
- The median of Sierpiński graphs
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\)
- On generalized Sierpiński graphs
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
- On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
- Security in Sierpiński graphs
- Some algebraic properties of Sierpiński-type graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- The Tower of Hanoi – Myths and Maths
- Total Domination in Graphs
- Recognizing generalized Sierpiński graphs
- Italian domination on Mycielskian and Sierpinski graphs
- On the roman domination number of generalized Sierpiński graphs
- The Sierpiński product of graphs
- On the zero forcing number of generalized Sierpinski graphs
- Structures of Domination in Graphs
- Topics in Domination in 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
- Packing coloring of generalized Sierpinski graphs
This page was built for publication: The Sierpiński domination number
