Constructing two completely independent spanning trees in hypercube-variant networks (Q338381)
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: Constructing two completely independent spanning trees in hypercube-variant networks |
scientific article; zbMATH DE number 6647910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing two completely independent spanning trees in hypercube-variant networks |
scientific article; zbMATH DE number 6647910 |
Statements
Constructing two completely independent spanning trees in hypercube-variant networks (English)
0 references
4 November 2016
0 references
completely independent spanning trees
0 references
hypercube-variant networks
0 references
CIST-partition
0 references
diameter
0 references
0.860421895980835
0 references
0.8569118976593018
0 references
0.834106981754303
0 references
0.8327455520629883
0 references
0.8024396896362305
0 references
