This is a preview. Log in through your library . Abstract This paper deals with the familiar notions of domination, independence and irredundance in an undirected graph. The corresponding minimum, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback