Binomial edge ideals constitute a vibrant research area where the methods of commutative algebra intersect with the combinatorial structures inherent in graph theory.

This paper deals with the familiar notions of domination, independence and irredundance in an undirected graph. The corresponding minimum, maximum, minimax and maximin parameters are described in ...