Lee distance and topological properties of k-ary n-cubes
From MaRDI portal
Publication:4421206
DOI10.1109/12.403718zbMath1054.68510OpenAlexW2149789327MaRDI QIDQ4421206
Yaagoub A. Ashir, Bob Broeg, Bella Bose, Younggeun Kwon
Publication date: 1995
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.403718
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (65)
\(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks ⋮ The diagnosability of thek-aryn-cubes using the pessimistic strategy ⋮ Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions ⋮ Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks ⋮ Quaternary \(n\)-cubes and isometric words ⋮ A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Path embeddings in faulty 3-ary \(n\)-cubes ⋮ Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links ⋮ Optimal wavelength assignment in the implementation of parallel algorithms with ternary \(n\)-cube communication pattern on mesh optical network ⋮ Fast decoding of quasi-perfect Lee distance codes ⋮ Conditional diagnosability of the round matching composition networks ⋮ Decompositions of circulant-balanced complete multipartite graphs based on a novel labelling approach ⋮ Adaptive Diagnosis of Hamiltonian Networks under the Comparison Model ⋮ Matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges ⋮ Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes ⋮ The 3-path-connectivity of the \(k\)-ary \(n\)-cube ⋮ An approach to conditional diagnosability analysis under the PMC model and its application to torus networks ⋮ The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model ⋮ Path and cycle fault tolerance of bubble-sort graph networks ⋮ Augmented \(k\)-ary \(n\)-cubes ⋮ Embedded edge connectivity of \(k\)-ary \(n\)-cubes ⋮ Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation ⋮ Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes ⋮ Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction ⋮ The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks ⋮ One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ Distance magic labeling of the halved folded \(n\)-cube ⋮ Extraconnectivity of \(k\)-ary \(n\)-cube networks ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Strong matching preclusion for \(k\)-ary \(n\)-cubes ⋮ 3-extra connectivity of 3-ary \(n\)-cube networks ⋮ The edge connectivity of expanded \(k\)-ary \(n\)-cubes ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ Cycle and Path Embedding on 5-ary N-cubes ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube ⋮ \(h\)-restricted connectivity of locally twisted cubes ⋮ EMPLOYINGK-ARY n-CUBES FOR PARALLEL LAGRANGE INTERPOLATION ⋮ On the extraconnectivity of k-ary n-cube networks ⋮ Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges ⋮ Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube ⋮ Quotients of Gaussian graphs and their application to perfect codes ⋮ Properties of a hierarchical network based on the star graph ⋮ Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\) ⋮ Panconnectivity and edge-pancyclicity ofk-aryn-cubes ⋮ Upper bounds on the queue number of \(k\)-ary \(n\)-cubes ⋮ Embedded connectivity of ternary \(n\)-cubes ⋮ Paired many-to-many disjoint path covers of hypertori ⋮ Distance magic labeling of the halved folded \(n\)-cube ⋮ Parallel Lagrange interpolation on \(k\)-ary \(n\)-cubes with maximum channel utilization ⋮ Some topological properties of star graphs: The surface area and volume ⋮ Unchanging the diameter ofk-aryn-cube networks with faulty vertices ⋮ Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges ⋮ The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes ⋮ Performance modelling of broadcast communication in multicomputer networks ⋮ Survey on path and cycle embedding in some networks ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Structure fault tolerance of \(k\)-ary \(n\)-cube networks ⋮ On \(k\)-ary \(n\)-cubes and isometric words ⋮ Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks ⋮ Codes from incidence matrices of some regular graphs ⋮ Algorithmic construction of Hamiltonians in pyramids
This page was built for publication: Lee distance and topological properties of k-ary n-cubes