Panconnectivity and edge-pancyclicity ofk-aryn-cubes

DOI10.1002/NET.20290zbMath1205.05126OpenAlexW4239617800MaRDI QIDQ3057098

Tsong-Jie Lin, Sun-Yuan Hsieh

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20290

zbMATH Keywords

graph theoryhypercubesedge-pancyclicitybipancyclicitypanconnectivity\(k\)-ary \(n\)-cubesgraph-theoretic interconnection networksbipanconnectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Connectivity (05C40)

Related Items (24)

A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Improving the panconnectedness property of locally twisted cubes ⋮ Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks ⋮ A panconnectivity theorem for bipartite graphs ⋮ Mutually independent bipanconnected property of hypercube ⋮ Paired 2-disjoint path covers of multidimensional torus networks with faulty edges ⋮ Bipanconnectivity of balanced hypercubes ⋮ The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ On pancyclicity properties of OTIS-mesh ⋮ The weakly dimension-balanced pancyclicity on toroidal mesh graph \(T_{m,n}\) When both \(m\) and \(n\) are odd ⋮ One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ Extraconnectivity of \(k\)-ary \(n\)-cube networks ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ Panconnectivity and edge-pancyclicity of multidimensional torus networks ⋮ Unchanging the diameter ofk-aryn-cube networks with faulty vertices ⋮ The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Pancyclicity and Cayley Graphs on Abelian Groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Edge-pancyclicity of Möbius cubes
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• Paths in Möbius cubes and crossed cubes
• Panconnectivity of locally connected claw-free graphs
• Pancyclicity of recursive circulant graphs
• Panconnectivity of locally twisted cubes
• Fault-tolerant pancyclicity of augmented cubes
• Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Cycles in folded hypercubes
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Lee distance and topological properties of k-ary n-cubes
• An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes

This page was built for publication: Panconnectivity and edge-pancyclicity ofk-aryn-cubes