Survey on path and cycle embedding in some networks
From MaRDI portal
Publication:1042541
DOI10.1007/s11464-009-0017-5zbMath1176.90081OpenAlexW2144682446MaRDI QIDQ1042541
Publication date: 14 December 2009
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-009-0017-5
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38)
Related Items (44)
Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges ⋮ Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ Hamilton paths and cycles in varietal hypercube networks with mixed faults ⋮ How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) ⋮ Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Edge-fault-tolerant diameter and bipanconnectivity of hypercubes ⋮ Long cycles in hypercubes with optimal number of faulty vertices ⋮ Conditional edge-fault pancyclicity of augmented cubes ⋮ Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle ⋮ Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time ⋮ Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes ⋮ Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes ⋮ Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes ⋮ The disjoint path cover in the data center network HSDC with prescribed vertices in each path ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs ⋮ The spanning cyclability of Cayley graphs generated by transposition trees ⋮ (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn ⋮ Geodesic pancyclicity of twisted cubes ⋮ Embedding Wheel - like Networks ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ Edge-bipancyclicity of star graphs with faulty elements ⋮ Paired many-to-many disjoint path covers of the hypercubes ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ The vertex-pancyclicity of data center networks ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks ⋮ Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Edge-fault-tolerant pancyclicity of arrangement graphs ⋮ Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ 1-vertex-fault-tolerant cycles embedding on folded hypercubes ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ Hamiltonicity of hypercubes with faulty vertices ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn ⋮ Panconnectivity and edge-pancyclicity of multidimensional torus networks ⋮ Cycles passing through a prescribed path in a hypercube with faulty edges ⋮ Fault-tolerant panconnectivity of augmented cubes ⋮ \(L(n)\) graphs are vertex-pancyclic and Hamilton-connected
Cites Work
- On ring embedding in hypercubes with faulty nodes and links
- Fault-tolerant cycle embedding in the hypercube
- Embedding longest fault-free paths onto star graphs with more vertex faults
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- On generalized twisted cubes
- On the embedding of cycles in pancake graphs
- On the k-ary hypercube
- Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
- Fault-tolerant Hamiltonicity of twisted cubes
- Hyper Hamiltonian laceability on edge fault star graph
- Hamilton connected graphs
- Longest fault-free paths in hypercubes with vertex faults
- The super laceability of the hypercubes
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Path bipancyclicity of hypercubes
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Edge-bipancyclicity of star graphs under edge-fault tolerant
- Optimal fault-tolerant embedding of paths in twisted cubes
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Weak-vertex-pancyclicity of (\(n,k\))-star graphs
- Edge-bipancyclicity of a hypercube with faulty vertices and edges
- Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
- Fault-tolerant embedding of paths in crossed cubes
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- A note on cycle embedding in folded hypercubes with faulty elements
- Fault-free cycles in folded hypercubes with more faulty elements
- Some results on topological properties of folded hypercubes
- Cycle embedding of augmented cubes
- Path embedding in faulty hypercubes
- Fault-free longest paths in star networks with conditional link faults
- Ring embedding in faulty pancake graphs
- Edge-fault-tolerant bipanconnectivity of hypercubes
- Long paths in hypercubes with conditional node-faults
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Fault-tolerant cycle-embedding of crossed cubes
- Edge-pancyclicity of Möbius cubes
- Edge-fault-tolerant edge-bipancyclicity of hypercubes
- Paths in Möbius cubes and crossed cubes
- A survey of the theory of hypercube graphs
- Edge-pancyclic block-intersection graphs
- Arrangement graphs: A class of generalized star graphs
- The square of a block is vertex pancyclic
- The \((n,k)\)-star graph: A generalized star graph
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Cycles in the cube-connected cycles graph
- On some super fault-tolerant Hamiltonian graphs
- Recursive circulants and their embeddings among hypercubes
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- Pancyclicity of recursive circulant graphs
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- Locally twisted cubes are 4-pancyclic.
- Topological properties of twisted cube
- Linear array and ring embeddings in conditional faulty hypercubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Panconnectivity of locally twisted cubes
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
- Fault-tolerant pancyclicity of augmented cubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Edge-bipancyclicity of conditional faulty hypercubes
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Hamiltonian properties on the class of hypercube-like networks
- Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Fault-tolerant cycle-embedding in alternating group graphs
- On embedding cycles into faulty twisted cubes
- Cycles in folded hypercubes
- Complete path embeddings in crossed cubes
- Pancyclic graphs. I
- Cycle embedding in star graphs with edge faults
- On the arrangement graph.
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Automorphisms of augmented cubes
- A group-theoretic model for symmetric interconnection networks
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- On the Diameter of the Pancake Network
- The Mobius cubes
- Lee distance and topological properties of k-ary n-cubes
- Cycle embedding in faulty wrapped butterfly graphs
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- The locally twisted cubes
- Hamiltonian-laceability of star graphs
- Augmented cubes
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
- Cycles in butterfly graphs
- A new class of interconnection networks based on the alternating group
- Some edge‐fault‐tolerant properties of the folded hypercube
- Algorithms and Computation
- Longest fault-free paths in star graphs with vertex faults
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Survey on path and cycle embedding in some networks
