Linear programming computations were carried out using. W e adopt notation and terminology f rom graph theory b y refer r ing to. This sho ws that. Ho w ev er, S can also hav e this prop ert y and. Marcel Dekk er, New Y ork, 1 9 98, pp.
A dvanc e d T opics .
$k$-Dependence and Domination in Kings Graphs
Thus, all vertices in the second ro w. The l i miting d ensities for 4 - an d 5-dep endent tor oidal kings. In the sp ecial case where n. L e ctur e Notes Comp. G is called vertex-tr ansitive if for ev ery t w o v ertices vu there exists an. A v ertex in the pow er domination set ob.