On the roman domination number of generalized Sierpiński graphs

DOI10.2298/FIL1720515RzbMath1499.05494arXiv1605.06918OpenAlexW2963568242WikidataQ57974179 ScholiaQ57974179MaRDI QIDQ5023115

No author found.

Publication date: 20 January 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.06918

zbMATH Keywords

Sierpiński graphRoman domination numbergeneralized Sierpiński graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Italian domination and perfect Italian domination on Sierpiński graphs ⋮ Unnamed Item ⋮ On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs ⋮ Unnamed Item ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ Connectivity and some other properties of generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Metric properties of generalized Sierpiński graphs over stars ⋮ On the zero forcing number of generalized Sierpinski graphs ⋮ Degree sequence of the generalized Sierpiński graph ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ On 2-rainbow domination number of functigraph and its complement ⋮ Recognizing generalized Sierpiński graphs ⋮ On roman domination number of functigraph and its complement ⋮ The double Roman domination number of generalized Sierpiński graphs

Cites Work

• 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
• Roman domination in regular graphs
• Defending the Roman Empire from multiple attacks
• Roman domination in graphs.
• New results on variants of covering codes in Sierpiński graphs
• The Tower of Hanoi – Myths and Maths
• The differential and the roman domination number of a graph
• 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
• Roman domination in Cartesian product graphs and strong product graphs
• The strong metric dimension of generalized Sierpiński graphs with pendant vertices
• A Roman domination chain