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, ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback