On the sum of two parameters concerning independence and irredundance in a graph
type: Item
instance of: scholarly article
title: On the sum of two parameters concerning independence and irredundance in a graph
zbMATH Open document ID: 0633.05059
DOI: 10.1016/0012-365X(88)90020-9
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: Let i(G) and IR(G) be the independent domination number and upper irredundance number of a graph G respectively. A conjecture that \(i(G)+IR(G)\leq 2p+2k-2\sqrt{2pk}\) was proposed in the paper of \textit{E. Cockayne, O. Favaron, C. Payan} and \textit{A. G. Thomason} in Discrete Math. 33, 249-258 (1981; Zbl 0471.05051), where \(p=| G|\) and k is the minimum degree of G. In this paper, we prove this conjecture.
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 4029629
zbMATH Keywords: independent domination number
zbMATH Keywords: upper irredundance number
author: Cheng-De Wang
MaRDI profile type: Publication
cites work: Contributions to the theory of domination, independence and irredundance in graphs
cites work: Graph-theoretic parameters concerning domination, independence, and irredundance
cites work: On the sum of cardinalities of extremum maximal independent sets
full work available at URL: 0012-365x(88)90020-9
OpenAlex ID: W2065954347
Recommended article: Q3743343
Recommended article: Q4405647
Recommended article: Independence and irredundance in \(k\)-regular graphs
Recommended article: ON THE SUM OF INDEPENDENCE NUMBER AND AVERAGE DEGREE OF A GRAPH
Recommended article: A note on graphs which have upper irredundance equal to independence
Recommended article: Q4871033
Recommended article: A degree sum condition concerning the connectivity and the independence number of a graph
Recommended article: Q4847233
Recommended article: Generalized domination, independence and irredudance in graphs
Recommended article: Q4527723
description: scientific article; zbMATH DE number 4029629