Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. (Q1426221): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:19, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. |
scientific article |
Statements
Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. (English)
0 references
14 March 2004
0 references
Edge-disjoint spanning trees
0 references
Node-disjoint paths
0 references
Alternating group graphs
0 references
Arrangement graphs
0 references
Fault tolerance
0 references
