Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
A 2024 study studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: