Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties
type: Item
instance of: scholarly article
title: Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties
zbMATH Open document ID: 1051.05069
author: Danuta Michalak
published in: Discrete Mathematics
publication date: 2004-10-01T00:00:00Z
review text: 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.
reviewed by: Bohdan Zelinka
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 2105620
zbMATH Keywords: domination
zbMATH Keywords: independence
zbMATH Keywords: irredundance
zbMATH Keywords: hereditary property
zbMATH Keywords: induced-hereditary property
zbMATH Keywords: additive property
MaRDI profile type: Publication
full work available at URL: j.disc.2003.11.054
OpenAlex ID: W2119945108
cites work: Q4189317
cites work: Graph-theoretic parameters concerning domination, independence, and irredundance
cites work: A survey of hereditary properties of graphs
cites work: Generalized domination, independence and irredudance in graphs
cites work: Properties of Hereditary Hypergraphs and Middle Graphs
cites work: Acyclic domination
DOI: 10.1016/J.DISC.2003.11.054
description: scientific article; zbMATH DE number 2105620