Independence, irredundance, degrees and chromatic number in graphs
type: Item
instance of: scholarly article
title: Independence, irredundance, degrees and chromatic number in graphs
zbMATH Open document ID: 1015.05069
DOI: 10.1016/S0012-365X(02)00585-X
author: Gábor Bacsó
author: Odile Favaron
published in: Discrete Mathematics
publication date: 2003-03-16T00:00:00Z
review text: For a graph \(G\), let \(\beta\), IR, \(\delta\) and \(\Delta\) denote the independence number, the upper irredundance number, and the minimum and maximum degree of \(G\). It is proved that if \(\Delta\neq 0\), then \(\text{IR}\leq n/(1+\delta/\Delta)\) and \(\text{IR}-\beta\leq (\Delta- 2)n/(2\Delta)\). The second inequality proves a conjecture of Rautenbach.
reviewed by: G. Gutin
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1882155
zbMATH Keywords: dominating sets
zbMATH Keywords: independence number
MaRDI profile type: Publication
full work available at URL: s0012-365x(02)00585-x
OpenAlex ID: W2069326022
description: scientific article; zbMATH DE number 1882155