RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS
From MaRDI portal
Publication:5884738
DOI10.15826/UMJ.2022.2.007OpenAlexW4313364542MaRDI QIDQ5884738
Mustapha Chellali, Saeed Kosari, Maryam Hajjari, Seyyed Mahmoud Sheikholeslami
Publication date: 24 March 2023
Published in: Ural Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/umj174
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(k\)-rainbow reinforcement numbers in graphs
- Some progress on the restrained Roman domination
- Restrained condition on double Roman dominating functions
- Total Roman reinforcement in graphs
- Bounds on the restrained Roman domination number of a graph
- Total k-rainbow reinforcement number in graphs
- Double Roman reinforcement number in graphs
- Quasi-total Roman reinforcement in graphs
This page was built for publication: RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS