On the sum of out-domination number and in-domination number of digraphs. (Q2804807)
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: On the sum of out-domination number and in-domination number of digraphs. |
scientific article; zbMATH DE number 6577887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sum of out-domination number and in-domination number of digraphs. |
scientific article; zbMATH DE number 6577887 |
Statements
4 May 2016
0 references
out-domination number
0 references
in-domination number
0 references
rooted tree
0 references
contrafunctional digraph
0 references
On the sum of out-domination number and in-domination number of digraphs. (English)
0 references
0.912306010723114
0 references
0.9107942581176758
0 references
0.8830486536026001
0 references
0.8598299026489258
0 references
0.8474702835083008
0 references
