Pages that link to "Item:Q533862"
From MaRDI portal
The following pages link to Constructing independent spanning trees for locally twisted cubes (Q533862):
Displayed 16 items.
- Locally exchanged twisted cubes: connectivity and super connectivity (Q269721) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- Independent spanning trees on twisted cubes (Q663434) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes (Q2043017) (← links)
- Symmetric property and reliability of locally twisted cubes (Q2208368) (← 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)
- A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Vertex-transitivity on folded crossed cubes (Q2630337) (← links)
- Constructing Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← links)
- Independent spanning trees in crossed cubes (Q5971214) (← links)
- Edge-independent spanning trees in folded crossed cubes (Q6168082) (← links)