Location-domatic number of a graph
Bohdan Zelinka (1998)
Mathematica Bohemica
Similarity:
A subset of the vertex set of a graph is called locating-dominating, if for each there exists a vertex adjacent to and for any two distinct vertices , of the intersections of with the neighbourhoods of and are distinct. The maximum number of classes of a partition of whose classes are locating-dominating sets in is called the location-domatic number of Its basic properties are studied.