Using maximality and minimality conditions to construct inequality chains (Q1377679): Difference between revisions

The following inequality chain for a graph first appeared in a paper by the first author and the fourth author of the present paper, with \textit{D. J. Miller}, in [Can. Math. Bull. 21, 461-468 (1978; Zbl 0393.05044)]: \(\text{ir}\leq\gamma\leq i\leq\beta\leq \Gamma\leq\text{IR}\), where ir and IR are the lower and upper irredundance numbers of a graph, \(\gamma\) and \(\Gamma\) are its lower and upper domination numbers, \(i\) is its independent domination number, and \(\beta\) is its vertex independence number. More than a hundred papers have since been published on aspects of this chain, and the present paper contains a brief historical review of its development. The authors also define a simple mechanism which explains why this inequality chain exists and how it is possible to define many similar chains.