Bohdan Zelinka, Katedra diskretni matematiky a statistiky TU, Halkova 6, 461 17 Liberec 1, Czech Republic, e-mail: bohdan.zelinka @vslib.cz
Abstract: A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called locating-dominating, if for each $x\in V(G)-D$ there exists a vertex $y\to D$ adjacent to $x$ and for any two distinct vertices $x_1$, $x_2$ of $V(G)-D$ the intersections of $D$ with the neighbourhoods of $x_1$ and $x_2$ are distinct. The maximum number of classes of a partition of $V(G)$ whose classes are locating-dominating sets in $G$ is called the location-domatic number of $G.$ Its basic properties are studied.
Keywords: locating-dominating set, location-domatic partition, location-domatic number, domatic number
Classification (MSC 1991): 05C35
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.
