On the public citation graph
Augmented cubes
0 signed · 178 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-3-7091-9076-0_13openalex-snapshot
Embedding one Interconnection Network in Another
inferredcites →https://doi.org/10.1016/0020-0190(93)90065-hopenalex-snapshot
A new variation on hypercubes with smaller diameter
inferredcites →https://doi.org/10.1016/0020-0190(94)00167-wopenalex-snapshot
Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
inferredcites →https://doi.org/10.1016/0020-0190(95)00040-jopenalex-snapshot
On generalized twisted cubes
inferredcites →https://doi.org/10.1016/s0020-0190(00)00147-2openalex-snapshot
The shuffle-cubes and their generalization
inferredcites →https://doi.org/10.1016/s0020-0190(97)00012-4openalex-snapshot
Connectivity of the crossed cube
inferredcites →https://doi.org/10.1016/s0020-0190(99)00033-2openalex-snapshot
On edge-disjoint spanning trees in hypercubes
inferredcites →https://doi.org/10.1016/s0020-0255(98)10045-2openalex-snapshot
Topological properties of twisted cube
inferredcites →https://doi.org/10.1080/00207160701543384openalex-snapshot
Automorphisms of augmented cubes
inferredcites →https://doi.org/10.1109/12.102840openalex-snapshot
A variation on the hypercube with lower diameter
inferredcites →https://doi.org/10.1109/12.392850openalex-snapshot
Embedding binary trees into crossed cubes
inferredcites →https://doi.org/10.1109/12.67323openalex-snapshot
The twisted N-cube with application to multiprocessing
inferredcites →https://doi.org/10.1109/2.191995openalex-snapshot
A survey of wormhole routing techniques in direct networks
inferredcites →https://doi.org/10.1109/71.205649openalex-snapshot
Fibonacci cubes-a new interconnection Topology
inferredcites →https://doi.org/10.1109/71.298203openalex-snapshot
Deadlock-free multicast wormhole routing in 2-D mesh multicomputers
inferredcites →https://doi.org/10.1109/71.877938openalex-snapshot
Implementing multidestination worms in switch-based parallel systems: architectural alternatives and their impact
inferredcites →https://doi.org/10.1109/ipps.1998.669919openalex-snapshot
Tree-based multicasting in wormhole-routed irregular topologies
inferredcites →https://doi.org/10.1137/0405002openalex-snapshot
Broadcasting in Bounded Degree Graphs
inferredcites →https://doi.org/10.21136/cpm.1984.108506openalex-snapshot
On Hamiltonian circuits and spanning trees of hypercubes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20291openalex-snapshot
Edge‐fault‐tolerant pancyclicity of alternating group graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-60239-0_4openalex-snapshot
Embedding Augmented Cubes into Grid Networks for Minimum Wirelength
inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_22openalex-snapshot
A Tight Bound for Congestion of an Embedding
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_47openalex-snapshot
Diagnosability of Two-Matching Composition Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-03095-6_12openalex-snapshot
Maximally Local Connectivity on Augmented Cubes
inferred← citeshttps://doi.org/10.1007/978-3-642-03095-6_63openalex-snapshot
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
inferred← citeshttps://doi.org/10.1007/978-3-642-22616-8_32openalex-snapshot
On the Surface Area of the Asymmetric Twisted Cube
inferred← citeshttps://doi.org/10.1007/978-981-15-8677-4_30openalex-snapshot
On Total Domination Number of Hypercube and Enhanced Hypercube Networks
inferred← citeshttps://doi.org/10.1007/s00373-017-1827-yopenalex-snapshot
Automorphism Group of the Varietal Hypercube Graph
inferred← citeshttps://doi.org/10.1007/s11227-011-0641-1openalex-snapshot
On the surface area of the augmented cubes
inferred← citeshttps://doi.org/10.1007/s11227-013-1040-6openalex-snapshot
Hyper-Hamiltonian laceability of balanced hypercubes
inferred← citeshttps://doi.org/10.1007/s11227-015-1417-9openalex-snapshot
2-Disjoint-path-coverable panconnectedness of crossed cubes
inferred← citeshttps://doi.org/10.1007/s11227-018-2295-8openalex-snapshot
The panpositionable panconnectedness of crossed cubes
inferred← citeshttps://doi.org/10.1007/s11227-018-2712-zopenalex-snapshot
The divide-and-swap cube: a new hypercube variant with small network cost
inferred← citeshttps://doi.org/10.1007/s11227-020-03420-wopenalex-snapshot
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes
inferred← citeshttps://doi.org/10.1007/s11227-021-04129-0openalex-snapshot
An O(log2 N) algorithm for reliability assessment of augmented cubes based on h-extra edge-connectivity
inferred← citeshttps://doi.org/10.1007/s11227-022-04758-zopenalex-snapshot
Star-structure connectivity of folded hypercubes and augmented cubes
inferred← citeshttps://doi.org/10.1007/s11227-022-04949-8openalex-snapshot
Diagnosability for a family of matching composition networks
inferred← citeshttps://doi.org/10.1007/s11227-023-05141-2openalex-snapshot
Reliability of augmented k-ary n-cubes under the extra connectivity condition
inferred← citeshttps://doi.org/10.1007/s11227-023-05845-5openalex-snapshot
Reliability analysis of the augmented cubes in terms of the h-extra r-component edge-connectivity
inferred← citeshttps://doi.org/10.1007/s11227-024-06168-9openalex-snapshot
Pendant 3-tree-connectivity of augmented cubes
inferred← citeshttps://doi.org/10.1007/s11227-024-06206-6openalex-snapshot
Fractional matchings on regular graphs
inferred← citeshttps://doi.org/10.1007/s11227-024-06633-5openalex-snapshot
Bandwidth of WK-recursive networks and its sparse matrix computation
inferred← citeshttps://doi.org/10.1007/s11227-025-07866-8openalex-snapshot
Fault tolerance assessment of exchanged crossed cube based on structure fault pattern
inferred← citeshttps://doi.org/10.1007/s11464-009-0017-5openalex-snapshot
Survey on path and cycle embedding in some networks
inferred← citeshttps://doi.org/10.1007/s11464-009-0042-4openalex-snapshot
Fault-tolerant panconnectivity of augmented cubes
inferred← citeshttps://doi.org/10.1007/s12190-025-02372-9openalex-snapshot
Structure connectivity of folded crossed cubes based on faulty stars
inferred← citeshttps://doi.org/10.1007/s12190-025-02445-9openalex-snapshot
Non-inclusive g-extra diagnosability of regular networks under the MM* model
inferred← citeshttps://doi.org/10.1007/s40305-023-00474-4openalex-snapshot
Two-Disjoint-Cycle-Cover Pancyclicity of Augmented Cubes
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.12.007openalex-snapshot
On regular subgraphs of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.amc.2007.02.089openalex-snapshot
Cycle embedding of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.amc.2008.10.061openalex-snapshot
Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.amc.2011.03.051openalex-snapshot
Super connectivity of k-regular interconnection networks
inferred← citeshttps://doi.org/10.1016/j.amc.2011.04.083openalex-snapshot
Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
inferred← citeshttps://doi.org/10.1016/j.amc.2018.03.002openalex-snapshot
Optimizing Hamiltonian panconnectedness for the crossed cube architecture
inferred← citeshttps://doi.org/10.1016/j.amc.2024.129197openalex-snapshot
2-Edge Hamiltonian connectedness: Characterization and results in data center networks
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.07.079openalex-snapshot
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
inferred← citeshttps://doi.org/10.1016/j.dam.2010.12.001openalex-snapshot
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
inferred← citeshttps://doi.org/10.1016/j.dam.2011.07.003openalex-snapshot
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
inferred← citeshttps://doi.org/10.1016/j.dam.2014.09.006openalex-snapshot
The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.070openalex-snapshot
The crossing number of locally twisted cubes LTQn
inferred← citeshttps://doi.org/10.1016/j.dam.2019.09.021openalex-snapshot
An improved algorithm to construct edge-independent spanning trees in augmented cubes
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.030openalex-snapshot
Edge-disjoint paths in faulty augmented cubes
inferred← citeshttps://doi.org/10.1016/j.dam.2023.05.029openalex-snapshot
The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.033openalex-snapshot
Two-disjoint-cycle-cover pancyclicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.dam.2026.08.003openalex-snapshot
Edge isoperimetric problem for antipodal subsets of the augmented cube
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.056openalex-snapshot
The distinguishing number of the augmented cube and hypercube powers
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.043openalex-snapshot
Edge-fault-tolerant hamiltonicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105401openalex-snapshot
A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Application to Hamiltonian decomposition
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105461openalex-snapshot
Characterizing k-edge Hamiltonian connectedness for enhancing network structures
inferred← citeshttps://doi.org/10.1016/j.ins.2010.06.016openalex-snapshot
The panpositionable panconnectedness of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.ins.2011.01.031openalex-snapshot
Fault-tolerant edge-pancyclicity of locally twisted cubes
inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.029openalex-snapshot
Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
inferred← citeshttps://doi.org/10.1016/j.ins.2014.02.036openalex-snapshot
Vertex-pancyclicity of augmented cubes with maximal faulty edges
inferred← citeshttps://doi.org/10.1016/j.ins.2014.03.022openalex-snapshot
Maximally local connectivity and connected components of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.ins.2014.12.026openalex-snapshot
Fault-tolerant Hamiltonian laceability of balanced hypercubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.09.013openalex-snapshot
The forwarding indices of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.10.013openalex-snapshot
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.02.012openalex-snapshot
Fault-tolerant pancyclicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.10.005openalex-snapshot
The super connectivity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.04.009openalex-snapshot
Edge-fault-tolerant vertex-pancyclicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.06.011openalex-snapshot
Wirelength of 1-fault hamiltonian graphs into wheels and fans
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.04.003openalex-snapshot
The optimal routing of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.08.006openalex-snapshot
Constructing spanning trees in augmented cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.03.017openalex-snapshot
Decomposition of augmented cubes into regular connected pancyclic subgraphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.08.009openalex-snapshot
Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.04.004openalex-snapshot
Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105141openalex-snapshot
Edge metric basis and its fault tolerance over certain interconnection networks
inferred← citeshttps://doi.org/10.1016/j.parco.2004.10.002openalex-snapshot
Fault hamiltonicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.parco.2006.11.008openalex-snapshot
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.015openalex-snapshot
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.015openalex-snapshot
A general technique to establish the asymptotic conditional diagnosability of interconnection networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.002openalex-snapshot
Strong matching preclusion for augmented cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.001openalex-snapshot
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.09.010openalex-snapshot
Conditional edge-fault pancyclicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.016openalex-snapshot
Edge-independent spanning trees in augmented cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.003openalex-snapshot
How many triangles and quadrilaterals are there in an n-dimensional augmented cube?
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.035openalex-snapshot
Edge-fault-tolerant strong Menger edge connectivity on regular graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.019openalex-snapshot
The number of short cycles in Fibonacci cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.020openalex-snapshot
Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.02.029openalex-snapshot
Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.021openalex-snapshot
The t/m-diagnosis strategy of augmented k-ary n-cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113784openalex-snapshot
Component Connectivity of Augmented Cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113860openalex-snapshot
Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114059openalex-snapshot
On the g-extra connectivity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114449openalex-snapshot
Integer k-matching preclusion of some interconnection networks
inferred← citeshttps://doi.org/10.1038/s41598-025-29965-5openalex-snapshot
Average distance between the processors of biswapped networks
inferred← citeshttps://doi.org/10.1038/s41598-025-96645-9openalex-snapshot
Acyclic and star coloring parameters of fractal cubic networks
inferred← citeshttps://doi.org/10.1080/00207160.2012.726711openalex-snapshot
An upper bound for the crossing number of augmented cubes
inferred← citeshttps://doi.org/10.1080/00207160.2013.860448openalex-snapshot
Improving the panconnectedness property of locally twisted cubes
inferred← citeshttps://doi.org/10.1080/00207160.2015.1067690openalex-snapshot
The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes
inferred← citeshttps://doi.org/10.1080/00207160.2015.1088943openalex-snapshot
Linear layout of locally twisted cubes
inferred← citeshttps://doi.org/10.1080/00207160701543384openalex-snapshot
Automorphisms of augmented cubes
inferred← citeshttps://doi.org/10.1080/09728600.2013.12088723openalex-snapshot
Fault tolerance of augmented cubes
inferred← citeshttps://doi.org/10.1080/17445760.2012.735234openalex-snapshot
Linearly many faults in augmented cubes
inferred← citeshttps://doi.org/10.1080/17445760.2025.2508170openalex-snapshot
Spanning edge-cyclability of augmented cubes
inferred← citeshttps://doi.org/10.1080/23799927.2018.1467487openalex-snapshot
Routing and wavelength assignment for augmented cubes in array-based wavelength-division-multiplexing optical networks
inferred← citeshttps://doi.org/10.1080/23799927.2024.2324255openalex-snapshot
Chromatic numbers of certain hypercube variants
inferred← citeshttps://doi.org/10.1080/23799927.2025.2508846openalex-snapshot
The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
inferred← citeshttps://doi.org/10.1093/comjnl/bxaa037openalex-snapshot
Strong Menger Connectedness of Augmented k-ary n-cubes
inferred← citeshttps://doi.org/10.1093/comjnl/bxac197openalex-snapshot
The Path-Structure Connectivity of Augmented k-ary n-cubes
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf056openalex-snapshot
Node-edge hybrid diagnosability and conditional node-edge hybrid diagnosability under the HPMC* model
inferred← citeshttps://doi.org/10.1093/comjnl/bxz088openalex-snapshot
Note on Applications of Linearly Many Faults
inferred← citeshttps://doi.org/10.1093/comjnl/bxz134openalex-snapshot
Three Types of Two-Disjoint-Cycle-Cover Pancyclicity and Their Applications to Cycle Embedding in Locally Twisted Cubes
inferred← citeshttps://doi.org/10.1109/access.2018.2847623openalex-snapshot
$t/t$ -Diagnosability and $t/k$ -Diagnosability for Augmented Cube Networks
inferred← citeshttps://doi.org/10.1109/access.2021.3095370openalex-snapshot
Many-to-Many Disjoint Paths in Augmented Cubes With Exponential Fault Edges
inferred← citeshttps://doi.org/10.1109/cis.2010.105openalex-snapshot
The Bipanconnectivity and Hamiltonian-Connectivity of Enhanced Hypercube
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00301openalex-snapshot
Research on the 2-Good-Neighbor Conditional Diagnosability of Augmented Cubes
inferred← citeshttps://doi.org/10.1109/i-span.2009.35openalex-snapshot
Efficient Algorithms for Embedding Cycles in Augmented Cubes
inferred← citeshttps://doi.org/10.1109/iccis.2012.135openalex-snapshot
Edge-pancyclicity and Edge-hamiltonian of Augmented Hypercube
inferred← citeshttps://doi.org/10.1109/iccsn.2015.7296199openalex-snapshot
Optimal routing and wavelength assignment for augmented cubes in linear array optical networks
inferred← citeshttps://doi.org/10.1109/icpads.2009.45openalex-snapshot
Pancyclicity and Panconnectivity in Augmented k-ary n-cubes
inferred← citeshttps://doi.org/10.1109/icpads60453.2023.00029openalex-snapshot
Forward Difference Properties of the (n, k)-Star Graph and Some Other Interconnection Networks
inferred← citeshttps://doi.org/10.1109/infoseee.2014.6948077openalex-snapshot
On the embedding of edge-disjoint Hamiltonian cycles in transposition networks
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470369openalex-snapshot
A general algorithm for detecting faults under the comparison diagnosis model
inferred← citeshttps://doi.org/10.1109/ispan.2004.1300474openalex-snapshot
Ring embedding in faulty augmented cubes
inferred← citeshttps://doi.org/10.1109/mines.2010.103openalex-snapshot
Vertex-Fault-Tolerant Cycles Embedding on Enhanced Hypercube
inferred← citeshttps://doi.org/10.1109/pdcat.2010.91openalex-snapshot
The Diagnosability of Augmented Cubes under PMC Model
inferred← citeshttps://doi.org/10.1109/tc.2013.64openalex-snapshot
Relating Diagnosability, Strong Diagnosability and Conditional Diagnosability of Strong Networks
inferred← citeshttps://doi.org/10.1109/tdsc.2009.52openalex-snapshot
Diagnosability of Two-Matching Composition Networks under the MM{}^{\ast} Model
inferred← citeshttps://doi.org/10.1109/tdsc.2010.22openalex-snapshot
Determining the Diagnosability of (1,2)-Matching Composition Networks and Its Applications
inferred← citeshttps://doi.org/10.1109/tdsc.2010.59openalex-snapshot
Conditional Diagnosability of Augmented Cubes under the PMC Model
inferred← citeshttps://doi.org/10.1109/tdsc.2016.2585489openalex-snapshot
Conditional $(t,k)$ -Diagnosis in Regular and Irregular Graphs Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/ton.2026.3670807openalex-snapshot
A Graph Neural Network Approach for Hybrid Node-Edge Fault Diagnosis in Interconnection Networks Under the HPMC * Model
inferred← citeshttps://doi.org/10.1109/tpds.2011.46openalex-snapshot
Conditional-Fault Diagnosability of Multiprocessor Systems with an Efficient Local Diagnosis Algorithm under the PMC Model
inferred← citeshttps://doi.org/10.1109/tpds.2020.3029654openalex-snapshot
Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube
inferred← citeshttps://doi.org/10.1109/tpds.2025.3558885openalex-snapshot
Symmetric Properties and Two Variants of Shuffle-Cubes
inferred← citeshttps://doi.org/10.1109/tr.2011.2170105openalex-snapshot
Strong Diagnosability and Conditional Diagnosability of Augmented Cubes Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/tr.2023.3330685openalex-snapshot
Reliability Assessment of Interconnection Networks Based on Link Fault Patterns
inferred← citeshttps://doi.org/10.1109/tr.2024.3371953openalex-snapshot
Fault-Tolerant Communication in HSDC: Ensuring Reliable Data Transmission in Smart Cities
inferred← citeshttps://doi.org/10.1109/tr.2026.3708856openalex-snapshot
An Adaptive Fault Diagnosis Scheme for the Augmented Cube-Based Data Center Networks
inferred← citeshttps://doi.org/10.1109/yac63405.2024.10598647openalex-snapshot
Embedding Complete Binary Trees CBTn into Augmented Cubes AQn
inferred← citeshttps://doi.org/10.1142/s0129054119500254openalex-snapshot
Fault-Tolerant Panconnectivity of Augmented Cubes AQn
inferred← citeshttps://doi.org/10.1142/s0129054122500150openalex-snapshot
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks
inferred← citeshttps://doi.org/10.1142/s0129054123500090openalex-snapshot
Embedding Augmented Cube into Certain Trees and Windmill Graphs
inferred← citeshttps://doi.org/10.1142/s0129626420400010openalex-snapshot
Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes
inferred← citeshttps://doi.org/10.1142/s0219265910002726openalex-snapshot
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES
inferred← citeshttps://doi.org/10.1142/s0219265912500041openalex-snapshot
EMBEDDING VARIANTS OF HYPERCUBES WITH DILATION 2
inferred← citeshttps://doi.org/10.1142/s0219265916710018openalex-snapshot
A Note on the Pessimistic Diagnosability of Augmented Cubes
inferred← citeshttps://doi.org/10.1142/s0219265921420196openalex-snapshot
Reliability Evaluation of Augmented Cubes on Degree
inferred← citeshttps://doi.org/10.1142/s0219265921500407openalex-snapshot
Reliability of Augmented 3-Ary n-Cubes with Extra Faults
inferred← citeshttps://doi.org/10.1142/s0219265923500317openalex-snapshot
Embedding Knödel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis
inferred← citeshttps://doi.org/10.1142/s0219265924500191openalex-snapshot
Hamiltonian Properties of Augmented k-Ary n-Cubes with Faulty Edges
inferred← citeshttps://doi.org/10.1142/s0219749922500204openalex-snapshot
Implementation of quantum hitting times of cubelike graphs on IBM’s Qiskit platform
inferred← citeshttps://doi.org/10.13005/ojc/420335openalex-snapshot
On the Spectral Parameters of certain Interconnection Networks, Nanosheets and Benzenoid Systems
inferred← citeshttps://doi.org/10.1587/transinf.2015pap0019openalex-snapshot
The Fault-Tolerant Hamiltonian Problems of Crossed Cubes with Path Faults
inferred← citeshttps://doi.org/10.17654/0974165826029openalex-snapshot
TOTAL CO-INDEPENDENT DOMINATION IN CARTESIAN PRODUCT OF GRAPHS WITH HYPERCUBES AND ITS VARIANTS
inferred← citeshttps://doi.org/10.26493/2590-9770.1481.29dopenalex-snapshot
Symmetry parameters of various hypercube families
inferred← citeshttps://doi.org/10.3390/math13111836openalex-snapshot
The Connectivity of DVcube Networks: A Survey
inferred← citeshttps://doi.org/10.3390/sym9060079openalex-snapshot
Path Embeddings with Prescribed Edge in the Balanced Hypercube Network
inferred← citeshttps://doi.org/10.3934/math.2021208openalex-snapshot
($ 2n-3 $)-fault-tolerant Hamiltonian connectivity of augmented cubes $ AQ_n $
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.159.285openalex-snapshot
Longest Cycles Embedding in Faulty Augmented Cube Networks
inferred← citeshttps://doi.org/10.61186/ijmsi.18.2.185openalex-snapshot
Embedding Wheel - like Networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.