Augmented cubes

From MaRDI portal
Publication:4785222

DOI10.1002/net.10033zbMath1019.05052OpenAlexW4247691285MaRDI QIDQ4785222

Sheshayya 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




Related Items (69)

An asymptotic relation between the wirelength of an embedding and the Wiener indexHow many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC modelEdge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault modelThe forwarding indices of augmented cubesGeodesic pancyclicity and balanced pancyclicity of augmented cubesFault-tolerant pancyclicity of augmented cubes\((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)Symmetry parameters of various hypercube familiesEdge-disjoint paths in faulty augmented cubesImproving the panconnectedness property of locally twisted cubesThe crossing number of locally twisted cubes \(L T Q_n\)Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented CubesStrong matching preclusion for augmented cubesDVcube: a novel compound architecture of disc-ring graph and hypercube-like graphConditional edge-fault pancyclicity of augmented cubesAutomorphism group of the varietal hypercube graphTwo-disjoint-cycle-cover vertex pancyclicity of augmented cubesThe intermittent diagnosability for two families of interconnection networks under the PMC model and MM* modelAugmented \(k\)-ary \(n\)-cubesEmbedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelengthThe \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubesMinimum average congestion of enhanced and augmented hypercubes into complete binary treesDiagnosability of Two-Matching Composition NetworksOn the \(g\)-extra connectivity of augmented cubesEmbedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection NetworksWirelength of \(1\)-fault Hamiltonian graphs into wheels and fansEmbedding Wheel - like NetworksInteger \(k\)-matching preclusion of some interconnection networksComponent connectivity of augmented cubesEdge-fault-tolerant strong Menger edge connectivity on regular graphsEdge-fault-tolerant vertex-pancyclicity of augmented cubesAutomorphisms of augmented cubesThe property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networksUnnamed ItemFlexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distanceEdge-independent spanning trees in augmented cubesThe optimal routing of augmented cubesFault-tolerant Hamiltonian laceability of balanced hypercubesThe super connectivity of augmented cubesThe distinguishing number of the augmented cube and hypercube powersLinear layout of locally twisted cubesThe restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubesFault-tolerant edge-pancyclicity of locally twisted cubesSuper connectivity of \(k\)-regular interconnection networksEmbedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positionsEmbedding Hamiltonian paths in augmented cubes with a required vertex in a fixed positionA general technique to establish the asymptotic conditional diagnosability of interconnection networksConditional edge-fault Hamiltonicity of augmented cubesEdge‐fault‐tolerant pancyclicity of alternating group graphsCycle embedding of augmented cubesThe panpositionable panconnectedness of augmented cubesThe number of short cycles in Fibonacci cubesMaximally local connectivity and connected components of augmented cubesVertex-pancyclicity of augmented cubes with maximal faulty edgesGeodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubesFault-Tolerant Panconnectivity of Augmented Cubes AQnEmbedding Hamiltonian cycles in alternating group graphs under conditional fault modelA survey of graphs with known or bounded crossing numbersAn improved algorithm to construct edge-independent spanning trees in augmented cubesFault-tolerant panconnectivity of augmented cubesConstructing Node-Independent Spanning Trees in Augmented CubesFault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networksSurvey on path and cycle embedding in some networksOptimizing Hamiltonian panconnectedness for the crossed cube architecturePath embeddings with prescribed edge in the balanced hypercube networkOn regular subgraphs of augmented cubesAn upper bound for the crossing number of augmented cubesImplementation of quantum hitting times of cubelike graphs on IBM’s Qiskit platform



Cites Work


This page was built for publication: Augmented cubes