Making a dominating set of a graph connected (Q1656909)
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: Making a dominating set of a graph connected |
scientific article; zbMATH DE number 6916580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Making a dominating set of a graph connected |
scientific article; zbMATH DE number 6916580 |
Statements
Making a dominating set of a graph connected (English)
0 references
10 August 2018
0 references
independent set
0 references
dominating set
0 references
connected dominating set
0 references
0 references
0.8693051338195801
0 references
0.8421185612678528
0 references
0.8372967839241028
0 references
