The Mobius cubes
From MaRDI portal
Publication:4419696
DOI10.1109/12.381950zbMath1041.68522OpenAlexW2161950066MaRDI QIDQ4419696
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.381950
Related Items (96)
On \(g\)-extra connectivity of hypercube-like networks ⋮ On the \(t/k\)-diagnosability of BC networks ⋮ Edge fault tolerance analysis of a class of interconnection networks ⋮ On the reliability of generalized Petersen graphs ⋮ Vertex-transitivity on folded crossed cubes ⋮ Node-pancyclicity and edge-pancyclicity of hypercube variants ⋮ Fault-tolerant analysis of a class of networks ⋮ A discrete random walk on the hypercube ⋮ Constructing two completely independent spanning trees in hypercube-variant networks ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ One-to-one communication in twisted cubes under restricted connectivity ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ Fault tolerance of Möbius cubes under two forbidden fault set models ⋮ The bipanconnectivity of bipartite hypercube-like networks ⋮ Fractional Strong Matching Preclusion for DHcube ⋮ A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model ⋮ Diagnosability for two families of composition networks ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ Connectivity for some families of composition networks ⋮ The fault-diameter and wide-diameter of twisted hypercubes ⋮ KMcube: the compound of Kautz digraph and Möbius cube ⋮ Conditional matching preclusion number of graphs ⋮ Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ Augmented \(k\)-ary \(n\)-cubes ⋮ Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity ⋮ Complete binary trees embeddings in Möbius cubes ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube ⋮ Conditional diagnosability of component-composition graphs under the PMC model ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ Möbius-deBruijn: the product of Möbius cube and deBruijn digraph ⋮ Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction ⋮ Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans ⋮ Super-connectivity and super-edge-connectivity for some interconnection networks ⋮ Embedding Wheel - like Networks ⋮ The spined cube: a new hypercube variant with smaller diameter ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ A new measure for locally \(t\)-diagnosable under PMC model ⋮ Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Hamiltonian properties of some compound networks ⋮ Edge-fault-tolerant strong Menger edge connectivity on regular graphs ⋮ On some super fault-tolerant Hamiltonian graphs ⋮ A fast fault-identification algorithm for bijective connection graphs using the PMC model ⋮ Edge-fault tolerance of hypercube-like networks ⋮ Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model ⋮ The spanning laceability on the faulty bipartite hypercube-like networks ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ Embedding of meshes in Möbius cubes ⋮ A note on minimum linear arrangement for BC graphs ⋮ A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model ⋮ Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks ⋮ Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes ⋮ Edge-pancyclicity and path-embeddability of bijective connection graphs ⋮ The wide-diameter of \(Z_{n, k}\) ⋮ Reliability analysis of bijective connection networks in terms of the extra edge-connectivity ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ A (4n − 9)/3 diagnosis algorithm for generalised cube networks ⋮ \(h\)-restricted connectivity of locally twisted cubes ⋮ The locally twisted cubes ⋮ The generalized measure of edge fault tolerance in exchanged crossed cube ⋮ Conditional diagnosability of a class of matching composition networks under the comparison model ⋮ Strong Menger connectivity with conditional faults on the class of hypercube-like networks ⋮ The two-equal-disjoint path cover problem of matching composition network ⋮ Hamiltonian properties of twisted hypercube-like networks with more faulty elements ⋮ Fibonacci hypercube ⋮ Linear layout of locally twisted cubes ⋮ The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ Efficient unicast in bijective connection networks with the restricted faulty node set ⋮ On embedding cycles into faulty twisted cubes ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ A note about some properties of BC graphs ⋮ Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults ⋮ A class of hierarchical graphs as topologies for interconnection networks ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ A lower bound on the size of \(k\)-neighborhood in generalized cubes ⋮ On the spanning connectivity and spanning laceability of hypercube-like networks ⋮ On the extra edge-connectivity of hypercubes ⋮ Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes ⋮ A Hypercube Variant with Small Diameter ⋮ Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks ⋮ Embedding a family of disjoint 3D meshes into a crossed cube ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs ⋮ The twisted-cube connected networks ⋮ Survey on path and cycle embedding in some networks ⋮ Edge-pancyclicity of Möbius cubes ⋮ Minimum neighborhood in a generalized cube ⋮ Paths in Möbius cubes and crossed cubes ⋮ Path embeddings with prescribed edge in the balanced hypercube network ⋮ A new structure for a vertex to be locally \(t\)-diagnosable in large multiprocessor systems ⋮ Generalized matching networks and their properties ⋮ Hamilton-connectivity and cycle-embedding of the Möbius cubes ⋮ The shuffle-cubes and their generalization ⋮ Component edge connectivity of hypercube-like networks ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
This page was built for publication: The Mobius cubes
