The paths embedding of the arrangement graphs with prescribed vertices in given position

DOI10.1007/S10878-011-9418-YMaRDI QIDQ1928512zbMATH OpenOpenAlexFDO

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

Publication date 3 January 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-011-9418-y

zbMATH Keywords

interconnection networkarrangement graphpanconnectedpanpositionable hamiltonian

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Network design and communication in computer systems (68M10)

Recommendations

• Embedding of cycles in arrangement graphs
• scientific article; zbMATH DE number 1617252
• Embeddings of \(k\)-connected graphs of pathwidth \(k\)
• Publication:3470476
• scientific article; zbMATH DE number 3857124
• Embedding planar graphs at fixed vertex locations
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
• Embedding longest fault-free paths in arrangement graphs with faulty vertices
• scientific article; zbMATH DE number 5238759
• Integer Programming and Combinatorial Optimization

Cites work

• A group-theoretic model for symmetric interconnection networks
• Arrangement graphs: A class of generalized star graphs
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Cycles in butterfly graphs
• Cycles in the cube-connected cycles graph
• Panconnectivity of locally twisted cubes
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• Panpositionable hamiltonicity of the alternating group graphs
• The forwarding indices of augmented cubes
• The two-equal-disjoint path cover problem of matching composition network

Cited in

(12)

• Cayley graph on symmetric group generated by elements fixing \(k\) points
• The number of shortest paths in the arrangement graph
• Determining the Hamilton-connectedness of certain vertex-transitive graphs
• Fault tolerance in the arrangement graphs
• Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
• The symmetry property of (n,k)‐arrangement graph
• scientific article; zbMATH DE number 1617252 (Why is no real title available?)
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• scientific article; zbMATH DE number 1185932 (Why is no real title available?)
• On the eigenvalues of certain Cayley graphs and arrangement graphs
• The structure fault tolerance of arrangement graphs
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges

This page was built for publication: The paths embedding of the arrangement graphs with prescribed vertices in given position

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