On the sum of two parameters concerning independence and irredundance in a graph (Q1095940)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4029629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sum of two parameters concerning independence and irredundance in a graph |
scientific article; zbMATH DE number 4029629 |
Statements
On the sum of two parameters concerning independence and irredundance in a graph (English)
0 references
1988
0 references
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.
0 references
independent domination number
0 references
upper irredundance number
0 references
0.89813703
0 references
0.8970164
0 references
0.8950144
0 references
0.8911139
0 references
0.8897767
0 references
