The paths embedding of the arrangement graphs with prescribed vertices in given position
DOI10.1007/s10878-011-9418-yzbMath1261.05101OpenAlexW1985297119MaRDI QIDQ1928512
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
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
Cites Work
- The forwarding indices of augmented cubes
- The two-equal-disjoint path cover problem of matching composition network
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Arrangement graphs: A class of generalized star graphs
- Cycles in the cube-connected cycles graph
- Panconnectivity of locally twisted cubes
- Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- A group-theoretic model for symmetric interconnection networks
- Cycles in butterfly graphs
- Panpositionable hamiltonicity of the alternating group graphs
This page was built for publication: The paths embedding of the arrangement graphs with prescribed vertices in given position