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




Related Items (65)

\(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networksThe diagnosability of thek-aryn-cubes using the pessimistic strategyPanconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictionsCommunication algorithms in \(k\)-ary \(n\)-cube interconnection networksQuaternary \(n\)-cubes and isometric wordsA type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubesPath embeddings in faulty 3-ary \(n\)-cubesEmbedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and linksOptimal wavelength assignment in the implementation of parallel algorithms with ternary \(n\)-cube communication pattern on mesh optical networkFast decoding of quasi-perfect Lee distance codesConditional diagnosability of the round matching composition networksDecompositions of circulant-balanced complete multipartite graphs based on a novel labelling approachAdaptive Diagnosis of Hamiltonian Networks under the Comparison ModelMatching preclusion for \(k\)-ary \(n\)-cubesFault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edgesMany-to-many disjoint path covers in \(k\)-ary \(n\)-cubesThe 3-path-connectivity of the \(k\)-ary \(n\)-cubeAn approach to conditional diagnosability analysis under the PMC model and its application to torus networksThe intermittent diagnosability for two families of interconnection networks under the PMC model and MM* modelPath and cycle fault tolerance of bubble-sort graph networksAugmented \(k\)-ary \(n\)-cubesEmbedded edge connectivity of \(k\)-ary \(n\)-cubesExact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and TreesThe reliability analysis of \(k\)-ary \(n\)-cube networksAn Exchanged 3-Ary n-Cube Interconnection Network for Parallel ComputationEdge-bipancyclicity in conditional edge-faulty k-ary n-cubesReliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restrictionThe \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networksOne-to-one disjoint path covers on \(k\)-ary \(n\)-cubesDistance magic labeling of the halved folded \(n\)-cubeExtraconnectivity of \(k\)-ary \(n\)-cube networksHamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubesStrong matching preclusion for \(k\)-ary \(n\)-cubes3-extra connectivity of 3-ary \(n\)-cube networksThe edge connectivity of expanded \(k\)-ary \(n\)-cubesEmbedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubesCycle and Path Embedding on 5-ary N-cubesEmbedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubesTwo-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube\(h\)-restricted connectivity of locally twisted cubesEMPLOYINGK-ARY n-CUBES FOR PARALLEL LAGRANGE INTERPOLATIONOn the extraconnectivity of k-ary n-cube networksEdge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edgesHamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cubeQuotients of Gaussian graphs and their application to perfect codesProperties of a hierarchical network based on the star graphBinary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)Panconnectivity and edge-pancyclicity ofk-aryn-cubesUpper bounds on the queue number of \(k\)-ary \(n\)-cubesEmbedded connectivity of ternary \(n\)-cubesPaired many-to-many disjoint path covers of hypertoriDistance magic labeling of the halved folded \(n\)-cubeParallel Lagrange interpolation on \(k\)-ary \(n\)-cubes with maximum channel utilizationSome topological properties of star graphs: The surface area and volumeUnchanging the diameter ofk-aryn-cube networks with faulty verticesPancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edgesThe \(h\)-extra connectivity of \(k\)-ary \(n\)-cubesPerformance modelling of broadcast communication in multicomputer networksSurvey on path and cycle embedding in some networksStructure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networksStructure fault tolerance of \(k\)-ary \(n\)-cube networksOn \(k\)-ary \(n\)-cubes and isometric wordsSuper Ck and Sub-Ck Connectivity of k-Ary n-Cube NetworksCodes from incidence matrices of some regular graphsAlgorithmic construction of Hamiltonians in pyramids




This page was built for publication: Lee distance and topological properties of k-ary n-cubes