Distance and Short Parallel Paths in Augmented Cubes
From MaRDI portal
Publication:3439032
DOI10.1016/S1571-0653(04)00532-3zbMath1259.05163MaRDI QIDQ3439032
V. Sunitha, Sheshayya A. Choudum
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
hypercubediameterconnectivitysimple graphwide-diameterinternally disjoint pathsaverage distancefault-diametermessage traffic density
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
\((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) ⋮ Automorphisms of augmented cubes ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn ⋮ Fault-tolerant panconnectivity of augmented cubes
This page was built for publication: Distance and Short Parallel Paths in Augmented Cubes