Open-Locating Dominating Number for Flower Snarks

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.