Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties (Q1883262)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties |
scientific article; zbMATH DE number 2105620
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties |
scientific article; zbMATH DE number 2105620 |
Statements
Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties (English)
0 references
1 October 2004
0 references
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.
0 references
domination
0 references
independence
0 references
irredundance
0 references
hereditary property
0 references
induced-hereditary property
0 references
additive property
0 references
