Pages that link to "Item:Q505430"
From MaRDI portal
The following pages link to Constructing completely independent spanning trees in crossed cubes (Q505430):
Displaying 18 items.
- Constructing two completely independent spanning trees in hypercube-variant networks (Q338381) (← links)
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138) (← links)
- Cycles embedding in balanced hypercubes with faulty edges and vertices (Q1701112) (← links)
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes (Q2043017) (← links)
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← links)
- Degree conditions for completely independent spanning trees of bipartite graphs (Q2093107) (← links)
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
- A Hamilton sufficient condition for completely independent spanning tree (Q2181228) (← links)
- Constructing dual-CISTs of folded divide-and-swap cubes (Q2219061) (← links)
- Reliability analysis based on the dual-CIST in shuffle-cubes (Q2242055) (← links)
- A well-equalized 3-CIST partition of alternating group graphs (Q2281160) (← links)
- Constructing dual-CISTs of DCell data center networks (Q2286061) (← links)
- A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871) (← links)
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? (Q2632013) (← links)
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5918548) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5925687) (← links)
- A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks (Q6569892) (← links)
