Bisection width of transposition graphs

DOI10.1016/S0166-218X(98)00009-2zbMath0902.68148OpenAlexW2162961204MaRDI QIDQ1392578

Ladislav Stacho, Imrich Vrt'o

Publication date: 10 December 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

interconnection networkstransposition graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (6)

Disjoint Hamilton cycles in transposition graphs ⋮ Automorphism group of the complete transposition graph ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Extremal even-cycle-free subgraphs of the complete transposition graphs ⋮ Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs ⋮ On randomized broadcasting in star graphs

Cites Work

• The complexity of finding minimum-length generator sequences
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• A Separator Theorem for Planar Graphs
• On VLSI layouts of the star graph and related networks
• Optimal numberings and isoperimetric problems on graphs
• Crossing Number Problems
• The Sums of Products of the Natural Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bisection width of transposition graphs