Decomposition of graphs into internally disjoint trees (Q3584205)
From MaRDI portal
!
WARNING
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 5775507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition of graphs into internally disjoint trees |
scientific article; zbMATH DE number 5775507 |
Statements
27 August 2010
0 references
Smarandache graphoidal tree \((k,d)\)-cover
0 references
graphoidal tree cover
0 references
complete graph
0 references
complete bipartite graph
0 references
product of path and cycle
0 references
0.7873616814613342
0 references
0.7427356243133545
0 references
0.7390578985214233
0 references
0.7388429045677185
0 references
