On the public citation graph

Panconnectivity and edge‐pancyclicity of k‐ary n‐cubes

https://doi.org/10.1002/net.20290

0 signed · 67 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.20039openalex-snapshot

Panconnectivity, fault‐tolerant hamiltonicity and hamiltonian‐connectivity in alternating group graphs

inferredcites →https://doi.org/10.1007/s11227-007-0133-5openalex-snapshot

Panconnectivity and edge-pancyclicity of 3-ary N-cubes

inferredcites →https://doi.org/10.1016/j.amc.2006.12.036openalex-snapshot

Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes

inferredcites →https://doi.org/10.1016/j.aml.2005.04.002openalex-snapshot

Cycles in folded hypercubes

inferredcites →https://doi.org/10.1016/j.aml.2005.08.021openalex-snapshot

Panconnectivity of locally twisted cubes

inferredcites →https://doi.org/10.1016/j.ipl.2004.09.026openalex-snapshot

Node-pancyclicity and edge-pancyclicity of crossed cubes

inferredcites →https://doi.org/10.1016/j.ipl.2005.06.006openalex-snapshot

Edge-fault-tolerant edge-bipancyclicity of hypercubes

inferredcites →https://doi.org/10.1016/j.ipl.2005.07.003openalex-snapshot

Edge-pancyclicity of Möbius cubes

inferredcites →https://doi.org/10.1016/j.ipl.2005.09.015openalex-snapshot

Paths in Möbius cubes and crossed cubes

inferredcites →https://doi.org/10.1016/j.ipl.2007.02.012openalex-snapshot

Fault-tolerant pancyclicity of augmented cubes

inferredcites →https://doi.org/10.1016/j.parco.2003.12.003openalex-snapshot

Pancyclicity on Möbius cubes with maximal edge faults

inferredcites →https://doi.org/10.1016/j.parco.2006.11.008openalex-snapshot

Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes

inferredcites →https://doi.org/10.1016/j.tcs.2007.10.016openalex-snapshot

Panconnectivity and edge-pancyclicity of faulty recursive circulant G ( 2 m , 4 )

inferredcites →https://doi.org/10.1016/s0012-365x(99)00010-2openalex-snapshot

Panconnectivity of locally connected claw-free graphs

inferredcites →https://doi.org/10.1016/s0020-0190(01)00226-5openalex-snapshot

Pancyclicity of recursive circulant graphs

inferredcites →https://doi.org/10.1016/s0045-7906(99)00003-8openalex-snapshot

The k-ary n-cube network: modeling, topological properties and routing strategies

inferredcites →https://doi.org/10.1109/12.403718openalex-snapshot

Lee distance and topological properties of k-ary n-cubes

inferredcites →https://doi.org/10.1109/71.615436openalex-snapshot

Fault diameter of k-ary n-cube networks

inferredcites →https://doi.org/10.1109/icpads.1997.652583openalex-snapshot

Embeddings of cycles, meshes and tori in faulty k-ary n-cubes

inferredcites →https://doi.org/10.1109/icpads.2001.934861openalex-snapshot

On some properties of k-ary n-cubes

inferredcites →https://doi.org/10.1109/mcc.1998.736438openalex-snapshot

Parallel Computation: Models And Methods

inferredcites →https://doi.org/10.1109/tc.2003.1234525openalex-snapshot

Edge disjoint hamiltonian cycles in k-ary n-cubes and hypercubes

inferredcites →https://doi.org/10.1109/tc.2006.104openalex-snapshot

Hamiltonian path embedding and pancyclicity on the Mobius cube with faulty nodes and faulty edges

inferredcites →https://doi.org/10.1137/0404045openalex-snapshot

On the Existence of Hamiltonian Circuits in Faulty Hypercubes

inferredcites →https://doi.org/10.1137/s0895480196311183openalex-snapshot

Fault-Tolerant Embeddings of Hamiltonian Circuits in k -ary n -Cubes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.21708openalex-snapshot

Pancyclicity and Cayley Graphs on Abelian Groups

inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_37openalex-snapshot

The Weakly Dimension-Balanced Pancyclicity on Toroidal Mesh Graph Tm,n When Both m and n Are Odd

inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2_8openalex-snapshot

Determining the Conditional Diagnosability of k-Ary n-Cubes Under the MM* Model

inferred← citeshttps://doi.org/10.1007/s11227-009-0356-8openalex-snapshot

Panconnectivity of Cartesian product graphs

inferred← citeshttps://doi.org/10.1007/s11227-016-1804-xopenalex-snapshot

Mutually independent Hamiltonianicity of Cartesian product graphs

inferred← citeshttps://doi.org/10.1007/s11390-017-1729-8openalex-snapshot

Optimal Path Embedding in the Exchanged Crossed Cube

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-013-0344-4openalex-snapshot

Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary n-cube with faulty edges

inferred← citeshttps://doi.org/10.1016/j.amc.2010.10.008openalex-snapshot

Mutually independent bipanconnected property of hypercube

inferred← citeshttps://doi.org/10.1016/j.camwa.2010.07.016openalex-snapshot

Bipanconnectivity of balanced hypercubes

inferred← citeshttps://doi.org/10.1016/j.dam.2011.05.008openalex-snapshot

Hamiltonian cycles passing through linear forests in k -ary n -cubes

inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.027openalex-snapshot

Panconnectivity of n -dimensional torus networks with faulty vertices and edges

inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.021openalex-snapshot

Panconnectivity and edge-pancyclicity of multidimensional torus networks

inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.006openalex-snapshot

Embedding various cycles with prescribed paths into k -ary n -cubes

inferred← citeshttps://doi.org/10.1016/j.disc.2017.08.024openalex-snapshot

A panconnectivity theorem for bipartite graphs

inferred← citeshttps://doi.org/10.1016/j.ins.2014.01.044openalex-snapshot

Hamiltonian path embeddings in conditional faulty k-ary n-cubes

inferred← citeshttps://doi.org/10.1016/j.ins.2014.08.003openalex-snapshot

Vertex-fault-tolerant cycles embedding in balanced hypercubes

inferred← citeshttps://doi.org/10.1016/j.ins.2015.02.005openalex-snapshot

Matchings extend to Hamiltonian cycles in k-ary n-cubes

inferred← citeshttps://doi.org/10.1016/j.ins.2017.11.047openalex-snapshot

Structure connectivity and substructure connectivity of k-ary n-cube networks

inferred← citeshttps://doi.org/10.1016/j.ipl.2010.11.027openalex-snapshot

On pancyclicity properties of OTIS-mesh

inferred← citeshttps://doi.org/10.1016/j.ipl.2015.10.001openalex-snapshot

Paired 2-disjoint path covers of multidimensional torus networks with faulty edges

inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.06.007openalex-snapshot

Hamiltonian cycle and path embeddings in 3-ary n -cubes based on K 1 , 3 -structure faults

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.035openalex-snapshot

One-to-one disjoint path covers on k -ary n -cubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.030openalex-snapshot

Extraconnectivity of k -ary n -cube networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.007openalex-snapshot

Paired 2-disjoint path covers of faulty k-ary n-cubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.029openalex-snapshot

A type of perfect matchings extend to hamiltonian cycles in k-ary n-cubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.020openalex-snapshot

Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.030openalex-snapshot

The h-extra connectivity of k-ary n-cubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.003openalex-snapshot

The reliability analysis of k-ary n-cube networks

inferred← citeshttps://doi.org/10.1080/00207160.2014.890189openalex-snapshot

Unchanging the diameter ofk-aryn-cube networks with faulty vertices

inferred← citeshttps://doi.org/10.1093/comjnl/bxae098openalex-snapshot

The h -faulty-block connectivity of k -ary n -cubes

inferred← citeshttps://doi.org/10.1093/comjnl/bxw050openalex-snapshot

Node-Pancyclic Properties of Biswapped Networks Based on Cycles in Their Factor Networks

inferred← citeshttps://doi.org/10.1093/comjnl/bxw071openalex-snapshot

Hamiltonian Cycle and Path Embeddings ink-Aryn-Cubes Based on Structure Faults

inferred← citeshttps://doi.org/10.1109/ccdc.2017.7978245openalex-snapshot

K1, 1-structure connectivity and K1, 1-substructure connectivity of torus networks

inferred← citeshttps://doi.org/10.1109/tpds.2011.22openalex-snapshot

Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption

inferred← citeshttps://doi.org/10.1109/tpds.2011.245openalex-snapshot

Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems

inferred← citeshttps://doi.org/10.1109/tpds.2021.3126254openalex-snapshot

Hamiltonian Paths of -cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests

inferred← citeshttps://doi.org/10.1109/trustcom.2016.0198openalex-snapshot

Hamiltonian Cycle and Path Embeddings in 3-Ary n-Cubes Based on K1,2-Structure Faults

inferred← citeshttps://doi.org/10.1142/s0129626418500135openalex-snapshot

Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks

inferred← citeshttps://doi.org/10.1142/s0219265924500038openalex-snapshot

Embedding Hamiltonian Paths with Prescribed Linear Forests into k-ary n-Cube Networks

inferred← citeshttps://doi.org/10.1142/s0219265925500070openalex-snapshot

A Cost-Performance Scalability Measure for Interconnection Networks and a Novel Scalable Cube-Based Topology

inferred← citeshttps://doi.org/10.2139/ssrn.6282944openalex-snapshot

Extending matchings to Hamiltonian paths with prescribed endvertices in $k$-ary $n$-cubes

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.