Pages that link to "Item:Q1019176"
From MaRDI portal
The following pages link to On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) (Q1019176):
Displaying 22 items.
- Independent spanning trees of chordal rings (Q294645) (← links)
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- Edge-independent spanning trees in augmented cubes (Q515545) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593) (← links)
- Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent (Q1080429) (← links)
- Constructing independent spanning trees on bubble-sort networks (Q1790945) (← links)
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080) (← links)
- Structural properties of subdivided-line graphs (Q2018541) (← links)
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377) (← 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)
- Linear time algorithms for finding independent spanning trees on pyramid networks (Q2307502) (← links)
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model (Q2446379) (← links)
- Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
- Completely independent spanning trees in torus networks (Q4648692) (← 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)
- Independent spanning trees in crossed cubes (Q5971214) (← links)
