Pages that link to "Item:Q1392523"
From MaRDI portal
The following pages link to Reliable broadcasting in product networks (Q1392523):
Displaying 23 items.
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- Edge-independent spanning trees in augmented cubes (Q515545) (← links)
- Constructing independent spanning trees for locally twisted cubes (Q533862) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- Independent spanning trees on twisted cubes (Q663434) (← links)
- Resource placement in Cartesian product of networks (Q666104) (← links)
- A multi-tree routing scheme using acyclic orientations (Q1575452) (← links)
- Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080) (← links)
- Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree (Q2071534) (← links)
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← links)
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932) (← links)
- An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Monochromatic connectivity and graph products (Q2798325) (← links)
- Path-connectivity of lexicographic product graphs (Q2804863) (← links)
- (Q4703869) (← links)
- Constructing Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← links)
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) (Q5187853) (← links)
- Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) (← links)
- Rainbow vertex-connection and graph products (Q5739599) (← links)
- Independent spanning trees in crossed cubes (Q5971214) (← links)