Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two (Q6570044)
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: Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two |
scientific article; zbMATH DE number 7879061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two |
scientific article; zbMATH DE number 7879061 |
Statements
Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two (English)
0 references
10 July 2024
0 references
domination
0 references
total domination
0 references
\(k\)-component domination
0 references
0.9113866686820984
0 references
0.901474952697754
0 references
0.8751183152198792
0 references
0.8301104307174683
0 references
0.8280026912689209
0 references
