On \(k\)-equivalence domination in graphs (Q3005178)
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 5904669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(k\)-equivalence domination in graphs |
scientific article; zbMATH DE number 5904669 |
Statements
7 June 2011
0 references
domination
0 references
irredundance
0 references
equivalence set
0 references
\(k\)-equivalence set
0 references
\(k\)-equivalence domination
0 references
\(k\)-equivalence irredundance
0 references
0.858930766582489
0 references
0.8529155850410461
0 references
0.8424482941627502
0 references
0.7758532762527466
0 references
0.7718928456306458
0 references
