Exact -step domination in graphs
Gary Chartrand, Frank Harary, Moazzem Hossain, Kelly Schultz (1995)
Mathematica Bohemica
Similarity:
For a vertex in a graph , the set consists of those vertices of whose distance from is 2. If a graph contains a set of vertices such that the sets , , form a partition of , then is called a -step domination graph. We describe -step domination graphs possessing some prescribed property. In addition, all -step domination paths and cycles are determined.