Domination parameters of generalized Sierpiński graphs
From MaRDI portal
Publication:6651148
DOI10.1080/09728600.2022.2138630MaRDI QIDQ6651148
Unnamed Author, V. Anu, Jismy Varghese
Publication date: 10 December 2024
Published in: AKCE International Journal of Graphs and Combinatorics (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
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Double Roman domination
- Italian domination in trees
- A survey and classification of Sierpiński-type graphs
- Roman domination in graphs.
- Domination parameters of a graph and its complement
- Perfect Italian domination in trees
- Double Roman domination number
- Some properties of double Roman domination
- Perfect Italian domination on planar and regular graphs
- Graphs with large Italian domination number
- Double Roman domination in digraphs
- On the double Roman domination in graphs
- Varieties of Roman Domination
- Roman Domination in Graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- 1-perfect codes in Sierpiński graphs
- Varieties of Roman domination II
- Italian domination on Mycielskian and Sierpinski graphs
- On the roman domination number of generalized Sierpiński graphs
- Italian domination and perfect Italian domination on Sierpiński graphs
- Impact of Vertex Addition on Italian Domination Number
- Restrained double Roman domination of a graph
- The double Roman domination number of generalized Sierpiński graphs
- An upper bound on the double Roman domination number
This page was built for publication: Domination parameters of generalized Sierpiński graphs
