\((k,r)\)-Irredundant sets in graphs (Q2968232)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: (k,r)-Irredundant sets in graphs |
scientific article; zbMATH DE number 6693864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \((k,r)\)-Irredundant sets in graphs |
scientific article; zbMATH DE number 6693864 |
Statements
(k, r)-IRREDUNDANT SETS IN GRAPHS (English)
0 references
10 March 2017
0 references
\((k,r)\)-irredundant sets
0 references
\((k,r)\)-dominating sets
0 references
0.8445499539375305
0 references
0.8125858306884766
0 references
0.8118284344673157
0 references
