Distance and Short Parallel Paths in Augmented Cubes

DOI10.1016/S1571-0653(04)00532-3MaRDI QIDQ3439032zbMATH OpenFDO

Authors S. A. Choudum, V. Sunitha

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0653(04)00532-3

zbMATH Keywords

average distanceconnectivitydiameterfault-diameterhypercubeinternally disjoint pathsmessage traffic densitysimple graphwide-diameter

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Shortest paths on cubes
• The path-distance-width of hypercubes
• Constructing the nearly shortest path in crossed cubes
• Disjoint paths in hypercubes with prescribed origins and lengths
• The optimal routing of augmented cubes
• Edge-disjoint paths in faulty augmented cubes
• Pairwise edge disjoint shortest paths in the \(n\)-cube
• scientific article; zbMATH DE number 1161303
• On Shortest Paths in Polyhedral Spaces

Cited in

(5)

• Fault-tolerant panconnectivity of augmented cubes
• \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
• The path-distance-width of hypercubes
• Automorphisms of augmented cubes
• Fault-Tolerant Panconnectivity of Augmented Cubes AQn

This page was built for publication: Distance and Short Parallel Paths in Augmented Cubes

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