Accurate Domination of Snake Graphs
There are various graph domination parameters used to express how vertices in a graph are influenced or controlled by others. One of them is the concept of accurate domination. A dominating set D of a graph G = (V;E) is an accurate dominating set, if V - D has no dominating set of cardinality |D|. The accurate domination number γa(G) of G is the minimum cardinality of an accurate dominating set. We are interested in obtaining the accurate domination number of triangular and quadrilateral snake graphs and relationship between this parameter and integrity value of any graph. Additionally, we present some ndings that connect the accurate domination number with strong/weak domination number of any graph.