Find in Library

Let P be a graph theoretic property concerning subsets of the vertex set V, which is either hereditary or super hereditary. We associate with this property P five graph theoretic parameters, namely a minimum parameter, a maximum parameter, a max-min parameter, a min-max parameter and a partition parameter. We initiate a study of these parameters for the properties of independence, domination and irredundance.