On the sum of two parameters concerning independence and irredundance in a graph (Q1095940): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(88)90020-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065954347 / rank | |||
Normal rank | |||
Latest revision as of 11:37, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the sum of two parameters concerning independence and irredundance in a graph |
scientific article |
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
