Year: 2024
Type: article
Abstract: The problem of finding an open-locating dominating set is a variant of the domination problem where both domination and the ability to identify a certain vertex are required.The cardinality of such a dominating set is called the open-locating dominating number.The open-locating domination problem has been proven to be NP-hard in the general case.In this paper, the exact value of the old domination number is provided for the class of Flower snark graphs.
Source: Matematički Vesnik
DOI: 10.57016/mv-zqfw8315
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4405913329