@article{Zelinka1998,
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\rightarrow 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.},
author = {Zelinka, Bohdan},
journal = {Mathematica Bohemica},
keywords = {locating-dominating set; location-domatic partition; location-domatic number; domatic number; locating-dominating set; location-domatic partition; location-domatic number; domatic number},
language = {eng},
number = {1},
pages = {67-71},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Location-domatic number of a graph},
url = {http://eudml.org/doc/248302},
volume = {123},
year = {1998},
}
TY - JOUR
AU - Zelinka, Bohdan
TI - Location-domatic number of a graph
JO - Mathematica Bohemica
PY - 1998
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 123
IS - 1
SP - 67
EP - 71
AB - 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\rightarrow 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.
LA - eng
KW - locating-dominating set; location-domatic partition; location-domatic number; domatic number; locating-dominating set; location-domatic partition; location-domatic number; domatic number
UR - http://eudml.org/doc/248302
ER -
