Pages that link to "Item:Q1392578"
From MaRDI portal
The following pages link to Bisection width of transposition graphs (Q1392578):
Displaying 11 items.
- Disjoint Hamilton cycles in transposition graphs (Q277617) (← links)
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)
- Automorphism group of the complete transposition graph (Q887942) (← links)
- On randomized broadcasting in star graphs (Q1003763) (← links)
- The bisection width and the isoperimetric number of arrays. (Q1428547) (← links)
- Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs (Q2009644) (← links)
- Extremal even-cycle-free subgraphs of the complete transposition graphs (Q2243230) (← links)
- Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs (Q3057177) (← links)
- On the bisection width of the transposition network (Q4345575) (← links)
- On bandwidth, cutwidth, and quotient graphs (Q4359287) (← links)
- Automorphism groups of Cayley graphs generated by general transposition sets (Q6614182) (← links)