id: 01792592
dt: j
an: 01792592
au: Schultz, Kelly
ti: Step domination in graphs.
so: Ars Comb. 55, 65-79 (2000).
py: 2000
pu: Charles Babbage Research Centre, Winnipeg, MB
la: EN
cc:
ut: graph distance; step domination; tree
ci:
li:
ab: The author determines the step domination number for several classes of
graphs and investigates it for trees. In a graph $G$ a set $S = \{ v_1,
v_2, \dots , v_n \}$ of vertices with associated sequence $k_1, k_2,
\dots , k_n$ of nonnegative integers is called a step domination set if
every vertex of $G$ is at distance $k_i$ from $v_i$ for exactly one
$i$. The minimum cardinality of a step domination set is called the
step domination number of the graph $G$.
rv: Robert Babilon (Praha)