Pancyclicity of Matching Composition Networks under the Conditional Fault Model
From MaRDI portal
Publication:5277671
DOI10.1109/TC.2010.229zbMath1365.68358OpenAlexW2008418242MaRDI QIDQ5277671
Publication date: 12 July 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2010.229
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
Two node-disjoint paths in balanced hypercubes ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ Improving the panconnectedness property of locally twisted cubes ⋮ The spanning laceability on the faulty bipartite hypercube-like networks ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Hamiltonicity of the Torus Network Under the Conditional Fault Model
This page was built for publication: Pancyclicity of Matching Composition Networks under the Conditional Fault Model