Dominating cycle of \(n\)-connected graph (Q4978539)
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 6759789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dominating cycle of \(n\)-connected graph |
scientific article; zbMATH DE number 6759789 |
Statements
DOMINATING CYCLE OF n-CONNECTED GRAPH (English)
0 references
11 August 2017
0 references
dominating cycle
0 references
4-stable set
0 references
spanning tree
0 references
stem
0 references
leaf
0 references
0.7957948446273804
0 references
0.792726457118988
0 references
