On the differences between the upper irredundance, upper domination and independence numbers of a graph
type: Item
instance of: scholarly article
title: On the differences between the upper irredundance, upper domination and independence numbers of a graph
zbMATH Open document ID: 0932.05071
DOI: 10.1016/S0012-365X(99)00008-4
author: Dieter Rautenbach
published in: Discrete Mathematics
publication date: 1999-09-12T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 1334489
zbMATH Keywords: independence
zbMATH Keywords: domination
zbMATH Keywords: irredundance number
MaRDI profile type: Publication
cites work: What is the difference between the domination and independent domination numbers of a cubic graph?
cites work: Contributions to the theory of domination, independence and irredundance in graphs
cites work: Properties of Hereditary Hypergraphs and Middle Graphs
cites work: Q3987051
cites work: Q4368729
cites work: Q4368728
cites work: Inequalities relating domination parameters in cubic graphs
cites work: Chordal graphs and upper irredundance, upper domination and independence
cites work: Q4873765
cites work: Disproof of a conjecture in the domination theory
description: scientific article; zbMATH DE number 1334489