Augmented cubes

DOI10.1002/NET.10033MaRDI QIDQ4785222zbMATH OpenOpenAlexFDO

Authors S. A. Choudum, V. Sunitha

Publication date 17 December 2002

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

hypercubeembeddingbroadcastingoptimal routing

Mathematics Subject Classification ID

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

Recommendations

• Automorphisms of augmented cubes
• On regular subgraphs of augmented cubes
• Fault-tolerant pancyclicity of augmented cubes
• The forwarding indices of augmented cubes
• Augmented \(k\)-ary \(n\)-cubes

Cited in

(78)

• Fault-Tolerant Panconnectivity of Augmented Cubes AQn
• DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• The restricted edge-connectivity and restricted connectivity of augmented \(k\)-ary \(n\)-cubes
• A survey of graphs with known or bounded crossing numbers
• Embedding augmented cube into certain trees and windmill graphs
• Edge-fault-tolerant vertex-pancyclicity of augmented cubes
• Edge-independent spanning trees in augmented cubes
• Vertex-pancyclicity of augmented cubes with maximal faulty edges
• Conditional edge-fault pancyclicity of augmented cubes
• Conditional edge-fault Hamiltonicity of augmented cubes
• On the \(g\)-extra connectivity of augmented cubes
• Geodesic pancyclicity and balanced pancyclicity of augmented cubes
• The forwarding indices of augmented cubes
• Symmetry parameters of various hypercube families
• Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
• Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
• Fault-tolerant panconnectivity of augmented cubes
• Edge-disjoint paths in faulty augmented cubes
• Component connectivity of augmented cubes
• Edge‐fault‐tolerant pancyclicity of alternating group graphs
• Fault-tolerant edge-pancyclicity of locally twisted cubes
• Path embeddings with prescribed edge in the balanced hypercube network
• Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
• How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
• Automorphisms of augmented cubes
• Survey on path and cycle embedding in some networks
• Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
• Constructing node-independent spanning trees in augmented cubes
• scientific article; zbMATH DE number 3949320 (Why is no real title available?)
• Strong matching preclusion for augmented cubes
• The optimal routing of augmented cubes
• Maximally local connectivity and connected components of augmented cubes
• Augmented \(k\)-ary \(n\)-cubes
• Edge-fault-tolerant strong Menger edge connectivity on regular graphs
• Wheel-augmented binary trees
• The super connectivity of augmented cubes
• Cycle embedding of augmented cubes
• Super connectivity of \(k\)-regular interconnection networks
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model
• \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
• The number of short cycles in Fibonacci cubes
• A general technique to establish the asymptotic conditional diagnosability of interconnection networks
• On regular subgraphs of augmented cubes
• The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model
• Improving the panconnectedness property of locally twisted cubes
• Expanding factors of graphs
• The distinguishing number of the augmented cube and hypercube powers
• scientific article; zbMATH DE number 1341739 (Why is no real title available?)
• Embedding Wheel - like Networks
• Integer \(k\)-matching preclusion of some interconnection networks
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• The crossing number of locally twisted cubes \(L T Q_n\)
• Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
• Diagnosability of Two-Matching Composition Networks
• Fault-tolerant pancyclicity of augmented cubes
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Linear layout of locally twisted cubes
• scientific article; zbMATH DE number 3985283 (Why is no real title available?)
• Automorphism group of the varietal hypercube graph
• An asymptotic relation between the wirelength of an embedding and the Wiener index
• Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
• The \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubes
• Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks
• scientific article; zbMATH DE number 1330132 (Why is no real title available?)
• Implementation of quantum hitting times of cubelike graphs on IBM's qiskit platform
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture
• Fault-tolerant maximal local-edge-connectivity of augmented cubes
• The panpositionable panconnectedness of augmented cubes
• Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
• An upper bound for the crossing number of augmented cubes
• Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
• On graphs like hypercubes
• Fault tolerance of augmented cubes
• One-to-one conditional path covers on augmented cubes
• Fault-tolerant Hamiltonian laceability of balanced hypercubes

This page was built for publication: Augmented cubes

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