Upper bounds on the signed total \((k, k)\)-domatic number of graphs (Q891310)
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: Upper bounds on the signed total (k, k)-domatic number of graphs |
scientific article; zbMATH DE number 6509477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the signed total \((k, k)\)-domatic number of graphs |
scientific article; zbMATH DE number 6509477 |
Statements
Upper bounds on the signed total \((k, k)\)-domatic number of graphs (English)
0 references
17 November 2015
0 references
signed total \((k, k)\)-domatic number
0 references
signed total \(k\)-dominating function
0 references
signed total \(k\)-domination number
0 references
regular graphs
0 references
0.9707697629928588
0 references
0.9605140686035156
0 references
0.9427312612533568
0 references
0.9356480240821838
0 references
0.9339670538902284
0 references
