The paths embedding of the arrangement graphs with prescribed vertices in given position
DOI10.1007/S10878-011-9418-YzbMATH Open1261.05101OpenAlexW1985297119MaRDI QIDQ1928512FDOQ1928512
Yuan-Hsiang Teng, Chey-Woei Tsay, Jimmy J. M. Tan, 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
Recommendations
- Embedding of cycles in arrangement graphs
- Publication:2721972
- 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
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)
Cites Work
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Arrangement graphs: A class of generalized star graphs
- A group-theoretic model for symmetric interconnection networks
- Panconnectivity of locally twisted cubes
- Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
- The two-equal-disjoint path cover problem of matching composition network
- Cycles in the cube-connected cycles graph
- Cycles in butterfly graphs
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- The forwarding indices of augmented cubes
- Panpositionable hamiltonicity of the alternating group graphs
Cited In (8)
- Fault tolerance in the arrangement graphs
- Title not available (Why is that?)
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- The structure fault tolerance of arrangement graphs
- The symmetry property of (n,k)‐arrangement graph
- Cayley graph on symmetric group generated by elements fixing \(k\) points
- Determining the Hamilton-connectedness of certain vertex-transitive graphs
- On the eigenvalues of certain Cayley graphs and arrangement graphs
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)
