On the public citation graph
Panconnectivity, fault‐tolerant hamiltonicity and hamiltonian‐connectivity in alternating group graphs
0 signed · 104 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.1002/jgt.3190100111openalex-snapshot
Minimum k ‐hamiltonian graphs, II
inferredcites →https://doi.org/10.1002/net.3230230414openalex-snapshot
A new class of interconnection networks based on the alternating group
inferredcites →https://doi.org/10.1006/jctb.1994.1058openalex-snapshot
4-Connected Projective-Planar Graphs Are Hamiltonian
inferredcites →https://doi.org/10.1006/jpdc.2001.1813openalex-snapshot
Fault-Tolerant Hamiltonicity of Twisted Cubes
inferredcites →https://doi.org/10.1007/bf02090766openalex-snapshot
Optimal embeddings of butterfly-like graphs in the hypercube
inferredcites →https://doi.org/10.1016/0020-0190(92)90030-yopenalex-snapshot
Arrangement graphs: a class of generalized star graphs
inferredcites →https://doi.org/10.1016/0020-0190(96)00114-7openalex-snapshot
Embedding a ring in a hypercube with both faulty links and faulty nodes
inferredcites →https://doi.org/10.1016/0166-218x(92)90152-zopenalex-snapshot
Product-shuffle networks: toward reconciling shuffles and butterflies
inferredcites →https://doi.org/10.1016/s0019-9958(86)80046-8openalex-snapshot
Solving tree problems on a mesh-connected processor array
inferredcites →https://doi.org/10.1016/s0020-0190(01)00256-3openalex-snapshot
Hamilton-connectivity and cycle-embedding of the Möbius cubes
inferredcites →https://doi.org/10.1016/s0020-0190(98)00004-0openalex-snapshot
Optimal 1-hamiltonian graphs
inferredcites →https://doi.org/10.1016/s0020-0190(98)00052-0openalex-snapshot
On the arrangement graph
inferredcites →https://doi.org/10.1016/s0020-0190(98)00066-0openalex-snapshot
Fault tolerant token ring embedding in double loop networks
inferredcites →https://doi.org/10.1016/s0020-0190(98)00159-8openalex-snapshot
On ring embedding in hypercubes with faulty nodes and links
inferredcites →https://doi.org/10.1016/s0020-0190(99)00122-2openalex-snapshot
Christmas tree: A versatile 1-fault-tolerant design for token rings
inferredcites →https://doi.org/10.1016/s0166-218x(01)00234-7openalex-snapshot
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness
inferredcites →https://doi.org/10.1109/12.238494openalex-snapshot
Embedding of cycles in arrangement graphs
inferredcites →https://doi.org/10.1109/12.260637openalex-snapshot
Fault-tolerant ring embedding in de Bruijn networks
inferredcites →https://doi.org/10.1109/12.376173openalex-snapshot
Embedding graphs onto the Supercube
inferredcites →https://doi.org/10.1109/71.262586openalex-snapshot
A comparative study of topological properties of hypercubes and star graphs
inferredcites →https://doi.org/10.1109/71.640010openalex-snapshot
Fault-tolerant ring embedding in a star graph with both link and node failures
inferredcites →https://doi.org/10.1109/71.755822openalex-snapshot
Fault-free Hamiltonian cycles in faulty arrangement graphs
inferredcites →https://doi.org/10.1109/71.910874openalex-snapshot
Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method
inferredcites →https://doi.org/10.1109/sfcs.1985.53openalex-snapshot
Solving tree problems on a mesh-connected processor array
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS
inferredcites →https://doi.org/10.1145/371209.371541openalex-snapshot
Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method
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.20184openalex-snapshot
Panpositionable hamiltonicity of the alternating group graphs
inferred← citeshttps://doi.org/10.1002/net.20290openalex-snapshot
Panconnectivity and edge‐pancyclicity of k‐ary n‐cubes
inferred← citeshttps://doi.org/10.1002/net.20291openalex-snapshot
Edge‐fault‐tolerant pancyclicity of alternating group graphs
inferred← citeshttps://doi.org/10.1007/11942634_31openalex-snapshot
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements
inferred← citeshttps://doi.org/10.1007/978-981-19-9582-8_15openalex-snapshot
Hamiltonian Properties of the Dragonfly Network
inferred← citeshttps://doi.org/10.1007/s10114-010-8383-1openalex-snapshot
Panconnectivity for interconnection networks with faulty elements
inferred← citeshttps://doi.org/10.1007/s10801-018-0843-1openalex-snapshot
The second largest eigenvalues of some Cayley graphs on alternating groups
inferred← citeshttps://doi.org/10.1007/s10878-011-9418-yopenalex-snapshot
The paths embedding of the arrangement graphs with prescribed vertices in given position
inferred← citeshttps://doi.org/10.1007/s11227-007-0133-5openalex-snapshot
Panconnectivity and edge-pancyclicity of 3-ary N-cubes
inferred← citeshttps://doi.org/10.1007/s11227-008-0257-2openalex-snapshot
The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube
inferred← citeshttps://doi.org/10.1007/s11227-009-0356-8openalex-snapshot
Panconnectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.1007/s11227-011-0614-4openalex-snapshot
Mutually independent Hamiltonian cycles in alternating group graphs
inferred← citeshttps://doi.org/10.1007/s11227-024-06294-4openalex-snapshot
The h-faulty-block connectivity of alternating group graphs and split-star networks
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/s12190-021-01565-2openalex-snapshot
Hamilton-connectivity of line graphs with application to their detour index
inferred← citeshttps://doi.org/10.1016/j.amc.2007.08.010openalex-snapshot
Fault-tolerant cycle-embedding in alternating group graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2007.08.073openalex-snapshot
Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
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.2022.127407openalex-snapshot
Two disjoint cycles of various lengths in alternating group graph
inferred← citeshttps://doi.org/10.1016/j.aml.2005.08.021openalex-snapshot
Panconnectivity of locally twisted cubes
inferred← citeshttps://doi.org/10.1016/j.aml.2010.09.009openalex-snapshot
The automorphism group of the alternating group graph
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.camwa.2010.07.016openalex-snapshot
Bipanconnectivity of balanced hypercubes
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2007.05.011openalex-snapshot
The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2009.01.002openalex-snapshot
Strongly Hamiltonian laceability of the even k-ary n-cube
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.018openalex-snapshot
Geodesic pancyclicity and balanced pancyclicity of the generalized base- b hypercube
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.049openalex-snapshot
Conditional edge-fault-tolerant Hamiltonicity of the data center network
inferred← citeshttps://doi.org/10.1016/j.future.2024.04.019openalex-snapshot
Enabling high fault-tolerant embedding capability of alternating group graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2007.04.013openalex-snapshot
The m-pancycle-connectivity of a WK-Recursive network
inferred← citeshttps://doi.org/10.1016/j.ins.2007.05.034openalex-snapshot
Linearly many faults in Cayley graphs generated by transposition trees
inferred← citeshttps://doi.org/10.1016/j.ins.2008.02.011openalex-snapshot
Hamiltonian connectivity of the WK-recursive network with faulty nodes
inferred← citeshttps://doi.org/10.1016/j.ins.2008.08.011openalex-snapshot
The bipancycle-connectivity of the hypercube
inferred← citeshttps://doi.org/10.1016/j.ins.2008.10.030openalex-snapshot
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
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.07.037openalex-snapshot
On vertex-pancyclicity and edge-pancyclicity of the WK-Recursive network
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.02.013openalex-snapshot
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.08.006openalex-snapshot
An optimal result on fault-tolerant cycle-embedding in alternating group graphs
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.01.007openalex-snapshot
A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs
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.2014.09.003openalex-snapshot
The pessimistic diagnosability of alternating group graphs under the PMC model
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105874openalex-snapshot
A well-equalized 3-CIST partition of alternating group graphs
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.2007.02.029openalex-snapshot
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.005openalex-snapshot
The bipanconnectivity and m -panconnectivity of the folded hypercube
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.10.016openalex-snapshot
Panconnectivity and edge-pancyclicity of faulty recursive circulant G ( 2 m , 4 )
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.2013.08.004openalex-snapshot
Two spanning disjoint paths with required length in generalized hypercubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.013openalex-snapshot
(n−3) -edge-fault-tolerant weak-pancyclicity of (n,k) -star graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.09.041openalex-snapshot
One-to-one disjoint path covers on alternating group graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.034openalex-snapshot
Extra diagnosability and good-neighbor diagnosability of n-dimensional alternating group graph AG under the PMC model
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.05.020openalex-snapshot
Optimal Embedding of Hypercube into Cylinder
inferred← citeshttps://doi.org/10.1051/ita:2008004openalex-snapshot
Cycle and Path Embedding on 5-ary N-cubes
inferred← citeshttps://doi.org/10.1080/00207160.2011.620093openalex-snapshot
Vertex-pancyclicity of twisted cubes with maximal faulty edges
inferred← citeshttps://doi.org/10.1080/23799927.2019.1694997openalex-snapshot
Edge-fault-tolerant pancyclicity of 2-tree-generated networks
inferred← citeshttps://doi.org/10.1109/access.2018.2882520openalex-snapshot
Fault-Tolerant Hamiltonian Connectivity of Twisted Hypercube-Like Networks THLNs
inferred← citeshttps://doi.org/10.1109/access.2019.2896101openalex-snapshot
Minimum Neighborhood of Alternating Group Graphs
inferred← citeshttps://doi.org/10.1109/access.2019.2929238openalex-snapshot
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity
inferred← citeshttps://doi.org/10.1109/cse.2011.68openalex-snapshot
Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order
inferred← citeshttps://doi.org/10.1109/icicic.2007.445openalex-snapshot
Path and Cycle Embedding of 3-ary N-cubes
inferred← citeshttps://doi.org/10.1109/icpads.2007.4447775openalex-snapshot
Embedding cycles and paths in a k-ary n-cube
inferred← citeshttps://doi.org/10.1109/nas.2007.52openalex-snapshot
The bi-panconnectivity of the hypercube
inferred← citeshttps://doi.org/10.1109/pdcat.2005.148openalex-snapshot
Hamiltonian-like Properties of k-Ary n-Cubes
inferred← citeshttps://doi.org/10.1109/pic.2018.8706296openalex-snapshot
Structure Connectivity and Substructure Connectivity of Alternating Group Graphs
inferred← citeshttps://doi.org/10.1109/tc.2012.15openalex-snapshot
Conditional Diagnosability of Alternating Group Graphs
inferred← citeshttps://doi.org/10.1109/tc.2015.2512866openalex-snapshot
The -Diagnosability for Regular Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2011.093011.100321openalex-snapshot
Fault-Tolerant Bipancyclicity of Faulty Hypercubes Under the Generalized Conditional-Fault Model
inferred← citeshttps://doi.org/10.1109/tpds.2008.45openalex-snapshot
Bipanconnectivity and Bipancyclicity in k-ary n-cubes
inferred← citeshttps://doi.org/10.1109/tpds.2014.2347961openalex-snapshot
The Extra Connectivity and Conditional Diagnosability of Alternating Group Networks
inferred← citeshttps://doi.org/10.1109/tpds.2022.3217415openalex-snapshot
The High Faulty Tolerant Capability of the Alternating Group Graphs
inferred← citeshttps://doi.org/10.1109/tr.2020.3021233openalex-snapshot
A Complete Fault Tolerant Method for Extra Fault Diagnosability of Alternating Group Graphs
inferred← citeshttps://doi.org/10.1134/s1064230706040083openalex-snapshot
Models and methods for solving the problem of network vulnerability
inferred← citeshttps://doi.org/10.1142/s021926591000274xopenalex-snapshot
ON THE EXISTENCE OF DISJOINT SPANNING PATHS IN FAULTY HYPERCUBES
inferred← citeshttps://doi.org/10.1155/2021/6684784openalex-snapshot
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
inferred← citeshttps://doi.org/10.3934/math.2021235openalex-snapshot
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
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.