Generalized Hypercube and Hyperbus Structures for a Computer Network

DOI10.1109/TC.1984.1676437MaRDI QIDQ3309028zbMATH OpenFDO

Authors Laxmi N. Bhuyan, Dharma P. Agrawal

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

topological optimizationparallel computerslocal area networksmultistage interconnection networkshypercube structuresdistributed computershyperbus structures

Mathematics Subject Classification ID

Circuits, networks (94C99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Cited in

(only showing first 100 items - show all)

• Lazy Cops and Robbers on generalized hypercubes
• DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
• Two spanning disjoint paths with required length in generalized hypercubes
• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
• Topological properties of twisted cube
• Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction
• Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes
• Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• Reliability measure of multiprocessor system based on enhanced hypercubes
• Two coloring problems on matrix graphs
• GOSSIPING IN BUS INTERCONNECTION NETWORKS
• Conditional edge-fault pancyclicity of augmented cubes
• Conditional edge-fault Hamiltonicity of augmented cubes
• RVCCC: a new variational network of cube-connected cycles and its topological properties
• Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults
• Mapping finite element graphs on hypercubes
• Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
• The generalized 3-connectivity of two kinds of regular networks
• The folded Petersen network: A new versatile multiprocessor interconnection topology
• Recognition of handwritten Hindu numerals using structural descriptors
• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
• Roman detour domination number of generalized hypercube networks
• On thek-ary hypercube tree and its average distance
• Combinatorial properties of generalized hypercube graphs
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs
• A further result on fault-free cycles in faulty folded hypercubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• 2-edge Hamiltonian connectedness: characterization and results in data center networks
• The bipanconnectivity of bipartite hypercube-like networks
• Embedding cycles in IEH graphs
• Cycles in butterfly graphs
• Communication algorithms in k-ary n-cube interconnection networks
• A new family of trivalent Cayley networks on wreath product \(Z_{m}\wr S_{n}^\ast\)
• The (n,k)-star graph: A generalized star graph
• Gossip Latin square and the meet-all gossipers problem
• Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
• The \(h\)-restricted connectivity of the generalized hypercubes
• Hamiltonian cycles and paths in faulty twisted hypercubes
• Conditional diagnosability of component-composition graphs under the PMC model
• Trivalent Cayley graphs for interconnection networks
• EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE
• Cycle embedding of augmented cubes
• Data center interconnection networks are not hyperbolic
• Containment properties of product and power graphs
• Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model
• The independence number for de Bruijn networks and Kautz networks
• Super spanning connectivity of the generalized hypercube network
• Supercube: An optimally fault tolerant network architecture
• On some super fault-tolerant Hamiltonian graphs
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• Solving elliptic partial differential equations on the hypercube multiprocessor
• scientific article; zbMATH DE number 2230273 (Why is no real title available?)
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• An extended generalized hypercube as a fault-tolerant system area network for multiprocessor systems
• Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\)
• Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
• A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
• Restricted connectivity for three families of interconnection networks
• Topological properties of supercube
• Incrementally extensible hypercube networks and their fault tolerance
• On some properties of doughnut graphs
• Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
• On the complexity of the embedding problem for hypercube related graphs
• Cycles in folded hypercubes with two adjacent faulty vertices
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
• IEH graphs. A novel generalization of hypercube graphs
• On embedding cycles into faulty twisted cubes
• Fault-tolerant cycles embedding in folded hypercubes
• The g-good-neighbor diagnosability of product networks under the PMC model
• Neighbor connectivity of undirected toroidal meshes
• Cube-like incidence complexes and their groups
• Embedding even cycles on folded hypercubes with conditional faulty edges
• The family of generalized variational network of cube-connected cycles
• Hypercube embedding heuristics: An evaluation
• Graph theoretic characterization and reliability of the multiple-clique network
• Randomized routing on generalized hypercubes
• Stirling networks: A versatile combinatorial topology for multiprocessor systems
• On the SD number and the ID number of generalized hypercube networks
• On the communication structures of hyper-ring and hypercube multicomputers
• Multiplicative circulant networks. Topological properties and communication algorithms
• Reliabilities for two kinds of graphs with smaller diameters
• An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
• Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube
• Cycles embedding in folded hypercubes with conditionally faulty vertices
• Reliability analysis of the generalized balanced hypercube
• Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
• Linear layouts of generalized hypercubes
• An upper bound for the crossing number of augmented cubes
• Bus interconnection networks
• Symmetric property and reliability of locally twisted cubes
• Dynamic processor allocation in scalable multiprocessors using boolean algebra^*
• Shuffle-ring: A new constant-degree network
• Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
• Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes
• A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency

This page was built for publication: Generalized Hypercube and Hyperbus Structures for a Computer Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309028)