The panpositionable panconnectedness of augmented cubes
From MaRDI portal
Publication:991906
DOI10.1016/j.ins.2010.06.016zbMath1205.68043MaRDI QIDQ991906
Lih-Hsing Hsu, Tzu-Liang Kung, Yuan-Hsiang Teng
Publication date: 8 September 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.06.016
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
The 2-path-bipanconnectivity of hypercubes, Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance, A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes, Improving the panconnectedness property of locally twisted cubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long paths in hypercubes with a quadratic number of faults
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Embedding of meshes in Möbius cubes
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes
- Distance formula and shortest paths for the \((n,k)\)-star graphs
- Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
- Improving bounds on link failure tolerance of the star graph
- Conditional edge-fault Hamiltonicity of augmented cubes
- An optimal result on fault-tolerant cycle-embedding in alternating group graphs
- Path embedding in star graphs
- Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
- Long paths in hypercubes with conditional node-faults
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Edge fault tolerance analysis of a class of interconnection networks
- Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
- The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
- Pancyclic graphs. I
- Augmented cubes
