Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties
The paper concerns properties of graphs. First they are considered from the general viewpoint. A graph property is defined as a non-empty class of graphs closed under isomorphisms. In this sense the author defines hereditary, induced-hereditary and additive properties of graphs. Then she continues by applying this to certain concrete properties, namely properties concerning domination, independence and irredundance and to the corresponding numerical invariants. Some results concerning them are presented.
scientific article; zbMATH DE number 2105620