On upper bounds for multiple domination numbers of graphs (Q2444571)
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 6282292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On upper bounds for multiple domination numbers of graphs |
scientific article; zbMATH DE number 6282292 |
Statements
On upper bounds for multiple domination numbers of graphs (English)
0 references
10 April 2014
0 references
dominating set
0 references
\(k\)-dominating set
0 references
\(k\)-tuple dominating set
0 references
\(k\)-tuple total dominating set
0 references
domination number
0 references
\(k\)-domination number
0 references
\(k\)-tuple domination number
0 references
\(k\)-tuple total domination number
0 references
liar's dominating set
0 references
0.8422559499740601
0 references
0.8364199995994568
0 references
0.8356449604034424
0 references
0.8353714942932129
0 references
0.8330010175704956
0 references
