Panpositionable hamiltonicity and panconnectivity of the arrangement graphs

DOI10.1016/J.AMC.2007.08.073MaRDI QIDQ2425998zbMATH OpenOpenAlexFDO

Authors Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu

Publication date 17 April 2008

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2007.08.073

zbMATH Keywords

interconnection networkHamiltonian grapharrangement graphpancyclic graphpanconnected graphpanpositionable Hamiltonian graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Recommendations

• The paths embedding of the arrangement graphs with prescribed vertices in given position
• Panpositionable hamiltonicity of the alternating group graphs
• Panpositionable Hamiltonian graphs.
• Determining the Hamilton-connectedness of certain vertex-transitive graphs
• Edge-fault-tolerant pancyclicity of arrangement graphs

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3550742 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• Arrangement graphs: A class of generalized star graphs
• Embedding of cycles in arrangement graphs
• On embedding cycles into faulty twisted cubes
• On the arrangement graph.
• On the spanningw-wide diameter of the star graph
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Pancyclic graphs. I
• Panpositionable hamiltonicity of the alternating group graphs
• Parallel concepts in graph theory

Cited in

(18)

• Conditional matching preclusion for the arrangement graphs
• Panpositionable Hamiltonian graphs.
• Fault diagnosability of arrangement graphs
• Two node-disjoint paths in balanced hypercubes
• Survey on path and cycle embedding in some networks
• Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
• Orienting the arrangement graphs
• Conditional fault tolerance of arrangement graphs
• Improving the panconnectedness property of locally twisted cubes
• Panconnectivity and edge-pancyclicity of multidimensional torus networks
• Edge-fault-tolerant pancyclicity of arrangement graphs
• The paths embedding of the arrangement graphs with prescribed vertices in given position
• Panpositionable hamiltonicity of the alternating group graphs
• Linearly many faults in arrangement graphs
• Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
• Determining the Hamilton-connectedness of certain vertex-transitive graphs
• On the bipanpositionable bipanconnectedness of hypercubes
• The panpositionable panconnectedness of augmented cubes

This page was built for publication: Panpositionable hamiltonicity and panconnectivity of the arrangement graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425998)