On the computational complexity of Roman$$\{2\}$$-domination in grid graphs
Crossref DOI link: https://doi.org/10.1007/s10878-023-01024-7
Published Online: 2023-04-14
Published Print: 2023-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Amouzandeh, Aflatoun
Moradi, Ahmad http://orcid.org/0000-0001-8511-7977
Text and Data Mining valid from 2023-04-01
Version of Record valid from 2023-04-01
Article History
Accepted: 24 March 2023
First Online: 14 April 2023
Declarations
:
: The authors have no relevant financial or non-financial interests to disclose.