Cycles in butterfly graphs

DOI<161::AID-NET7>3.0.CO;2-Q 10.1002/(SICI)1097-0037(200003)35:2<161::AID-NET7>3.0.CO;2-QzbMath0957.90016OpenAlexW2017140915MaRDI QIDQ4953326

Gen-Huey Chen, Shien-Ching Hwang

Publication date: 9 May 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200003)35:2<161::aid-net7>3.0.co;2-q

zbMATH Keywords

cycle partitionbutterfly graphpancyclefault-tolerant ring embedding

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs ⋮ Edge-bipancyclicity of conditional faulty hypercubes ⋮ Vertex-bipancyclicity of the generalized honeycomb tori ⋮ Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs ⋮ The paths embedding of the arrangement graphs with prescribed vertices in given position ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ Geodesic pancyclicity of twisted cubes ⋮ Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position ⋮ Bipancyclic properties of Cayley graphs generated by transpositions ⋮ On embedding cycles into faulty twisted cubes ⋮ Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position ⋮ Edge‐fault‐tolerant pancyclicity of alternating group graphs ⋮ Unnamed Item ⋮ The forwarding indices of wrapped butterfly networks ⋮ Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes ⋮ Fault-tolerant cycle-embedding of crossed cubes ⋮ Edge-pancyclicity of recursive circulants ⋮ Survey on path and cycle embedding in some networks ⋮ Edge-fault-tolerant edge-bipancyclicity of hypercubes ⋮ Pancyclicity of recursive circulant graphs

Cites Work

• Unnamed Item
• Decomposing a star graph into disjoint cycles
• Two edge-disjoint hamiltonian cycles in the butterfly graph
• Cycles in the cube-connected cycles graph
• Hamilton circuits in the directed wrapped Butterfly network
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Optimal embeddings of butterfly-like graphs in the hypercube
• Group Action Graphs and Parallel Architectures
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• A group-theoretic model for symmetric interconnection networks
• On the Fault Tolerance of Some Popular Bounded-Degree Networks
• Optimal emulations by butterfly-like networks
• Efficient Gossiping by Packets in Networks with Random Faults
• Spanners of Hypercube-Derived Networks
• Hamilton cycles and paths in butterfly graphs