Constructing optimal subnetworks for the crossed cube network

DOI10.1002/NET.20462MaRDI QIDQ4648694zbMATH OpenOpenAlexFDO

Authors Dajin Wang

Publication date 15 November 2012

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20462

zbMATH Keywords

connectivitycrossed cubeinduced subgraphinterconnection architecturesnetwork topology

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Structure connectivity and substructure connectivity of the crossed cube
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
• On the double-vertex-cycle-connectivity of crossed cubes
• Restricted connectivity of crossed cubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults

Cites work

• Characterization of Connection Assignment of Diagnosable Systems
• Connectivity of the crossed cube
• Embedding a family of disjoint multi-dimensional meshes into a crossed cube
• Embedding binary trees into crossed cubes
• Fault-tolerant cycle-embedding of crossed cubes
• Topological properties of the crossed cube architecture

Cited in

(1)

• Super spanning connectivity on WK-recursive networks

This page was built for publication: Constructing optimal subnetworks for the crossed cube network

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