Pages that link to "Item:Q1426221"
From MaRDI portal
The following pages link to Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. (Q1426221):
Displaying 13 items.
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593) (← links)
- Constructing edge-disjoint spanning trees in locally twisted cubes (Q1006074) (← links)
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security (Q1602520) (← links)
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080) (← links)
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932) (← links)
- Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
- Orienting the arrangement graphs (Q2718363) (← links)
- Efficient broadcasting in an arrangement graph using multiple spanning trees (Q2760286) (← links)
- Independent spanning trees on folded hyper-stars (Q3064044) (← links)
- Fault-Tolerant Broadcasting on the Arrangement Graph (Q4226636) (← links)
- (Q5506265) (← links)
- Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks (Q6652460) (← links)