Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
From MaRDI portal
Publication:884473
DOI10.1016/J.TCS.2007.02.029zbMATH Open1115.68116OpenAlexW2057844859MaRDI QIDQ884473FDOQ884473
Authors: Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim 
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
Recommendations
- Panconnectivity for interconnection networks with faulty elements
- Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
- Pancyclicity of restricted hypercube-like networks under the conditional fault model
- Panconnectivity of \(n\)-dimensional torus networks with faulty vertices and edges
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
- Pancyclicity of ternary \(n\)-cube networks under the conditional fault model
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Bipanconnectivity of faulty hypercubes with minimum degree
- On the maximal connected component with faulty vertices on the class of hypercube-like networks
- Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
embeddingfault toleranceinterconnection networksedge-pancyclicpancyclicpanconnectedfault-hamiltonicityrestricted HL-graphs
Cites Work
- Graph theory
- The twisted N-cube with application to multiprocessing
- Fault-tolerant cycle-embedding of crossed cubes
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- Panconnectivity of locally twisted cubes
- On embedding cycles into faulty twisted cubes
- Cycle embedding in star graphs with edge faults
- The locally twisted cubes
- Algorithms and Computation
- Edge-pancyclicity of recursive circulants
- Recursive circulants and their embeddings among hypercubes
- On the generalized twisted cube
- Counting structures in the Möbius ladder
- On ring embedding in hypercubes with faulty nodes and links
- Hamiltonian properties on the class of hypercube-like networks
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Pancyclicity of recursive circulant graphs
Cited In (51)
- Embedding Wheel - like Networks
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Edge-fault-tolerant vertex-pancyclicity of augmented cubes
- Vertex-pancyclicity of augmented cubes with maximal faulty edges
- Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
- Edge‐fault‐tolerant pancyclicity of alternating group graphs
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- Fault-tolerant panconnectivity of augmented cubes
- The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- Hamiltonian cycles in hypercubes with more faulty edges
- Construction independent spanning trees on locally twisted cubes in parallel
- Survey on path and cycle embedding in some networks
- The bipanconnectivity of bipartite hypercube-like networks
- Bipanconnectivity of balanced hypercubes
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
- Conditional diagnosability of component-composition graphs under the PMC model
- Panconnectivity of \(n\)-dimensional torus networks with faulty vertices and edges
- Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- The spanning laceability on the faulty bipartite hypercube-like networks
- Disjoint path covers with path length constraints in restricted hypercube-like graphs
- Improving the panconnectedness property of locally twisted cubes
- Edge-fault tolerance of hypercube-like networks
- Panconnectivity and edge-pancyclicity of multidimensional torus networks
- Panconnectivity for interconnection networks with faulty elements
- Embedding of meshes in Möbius cubes
- Fault-tolerant diameter for three family interconnection networks
- Pancyclicity of ternary \(n\)-cube networks under the conditional fault model
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs
- Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
- The crossing number of locally twisted cubes \(L T Q_n\)
- Linear layout of locally twisted cubes
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- Hamiltonian properties of twisted hypercube-like networks with more faulty elements
- The bicube: an interconnection of two hypercubes
- On hypohamiltonian and almost hypohamiltonian graphs
- The Kirchhoff index of hypercubes and related complex networks
- Lattice graphs with non-concurrent longest cycles
- Complete binary trees embeddings in Möbius cubes
- Wide diameter for two families of interconnection networks
- Highly non-concurrent longest paths in lattices
- Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
- Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network
- Infinitely many hypohamiltonian cubic graphs of girth 7
- Embedding of tori and grids into twisted cubes
- Hamiltonian properties on a class of circulant interconnection networks
- A note on path embedding in crossed cubes with faulty vertices
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
- Vertex-pancyclicity of twisted cubes with maximal faulty edges
This page was built for publication: Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884473)
