Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
From MaRDI portal
Publication:884473
DOI10.1016/j.tcs.2007.02.029zbMath1115.68116OpenAlexW2057844859MaRDI QIDQ884473
Hee-Chul Kim, Hyeong-Seok Lim, Jung-Heum Park
Publication date: 6 June 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.029
embeddingfault toleranceinterconnection networkspancyclicedge-pancyclicpanconnectedfault-hamiltonicityrestricted HL-graphs
Related Items (49)
Construction independent spanning trees on locally twisted cubes in parallel ⋮ Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links ⋮ Cycles passing through prescribed edges in a hypercube with some faulty edges ⋮ Improving the panconnectedness property of locally twisted cubes ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ The bipanconnectivity of bipartite hypercube-like networks ⋮ The crossing number of locally twisted cubes \(L T Q_n\) ⋮ Bipanconnectivity of balanced hypercubes ⋮ Complete binary trees embeddings in Möbius cubes ⋮ Conditional diagnosability of component-composition graphs under the PMC model ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements ⋮ Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans ⋮ Embedding Wheel - like Networks ⋮ Pancyclicity of ternary \(n\)-cube networks under the conditional fault model ⋮ Fault-tolerant diameter for three family interconnection networks ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Edge-fault tolerance of hypercube-like networks ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ Edge-fault-tolerant vertex-pancyclicity of augmented cubes ⋮ Infinitely many hypohamiltonian cubic graphs of girth 7 ⋮ Wide diameter for two families of interconnection networks ⋮ Lattice graphs with non-concurrent longest cycles ⋮ Embedding of meshes in Möbius cubes ⋮ Highly non-concurrent longest paths in lattices ⋮ Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance ⋮ Vertex-pancyclicity of twisted cubes with maximal faulty edges ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube ⋮ A note on path embedding in crossed cubes with faulty vertices ⋮ Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model ⋮ Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) ⋮ Hamiltonian properties of twisted hypercube-like networks with more faulty elements ⋮ Panconnectivity for interconnection networks with faulty elements ⋮ Linear layout of locally twisted cubes ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ Embedding of tori and grids into twisted cubes ⋮ Edge‐fault‐tolerant pancyclicity of alternating group graphs ⋮ Vertex-pancyclicity of augmented cubes with maximal faulty edges ⋮ Panconnectivity and edge-pancyclicity of multidimensional torus networks ⋮ Hamiltonian cycles in hypercubes with more faulty edges ⋮ The Kirchhoff index of hypercubes and related complex networks ⋮ The bicube: an interconnection of two hypercubes ⋮ Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes ⋮ Fault-tolerant panconnectivity of augmented cubes ⋮ Survey on path and cycle embedding in some networks ⋮ Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network ⋮ On Hypohamiltonian and Almost Hypohamiltonian Graphs ⋮ Hamiltonian properties on a class of circulant interconnection networks ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
Cites Work
- Unnamed Item
- On ring embedding in hypercubes with faulty nodes and links
- On the generalized twisted cube
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Fault-tolerant cycle-embedding of crossed cubes
- Edge-pancyclicity of recursive circulants
- Recursive circulants and their embeddings among hypercubes
- Counting structures in the Möbius ladder
- Pancyclicity of recursive circulant graphs
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- Panconnectivity of locally twisted cubes
- Hamiltonian properties on the class of hypercube-like networks
- On embedding cycles into faulty twisted cubes
- Cycle embedding in star graphs with edge faults
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- The locally twisted cubes
- The twisted N-cube with application to multiprocessing
- Algorithms and Computation
This page was built for publication: Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
