Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes

DOI10.1016/j.ins.2015.02.005zbMath1360.68652OpenAlexW1966117739MaRDI QIDQ528780

Heping Zhang, Fan Wang

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.02.005

zbMATH Keywords

matchingHamiltonian cycleperfect matchinginterconnection network\(k\)-ary \(n\)-cube

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ RVCCC: a new variational network of cube-connected cycles and its topological properties ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements ⋮ Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes

This page was built for publication: Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes