On the public citation graph

Panpositionable hamiltonicity of the alternating group graphs

0 signed · 22 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.1002/net.3230230414openalex-snapshot
A new class of interconnection networks based on the alternating group
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/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.811118openalex-snapshot
Achieving fault-tolerant multicast in injured wormhole-routed tori and meshes based on Euler path construction
inferredcites →https://doi.org/10.1109/71.298203openalex-snapshot
Deadlock-free multicast wormhole routing in 2-D mesh multicomputers

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-96093-2_26openalex-snapshot
Conditional Structural Connectivity in Alternating Group Graphs
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-011-0614-4openalex-snapshot
Mutually independent Hamiltonian cycles in alternating group graphs
inferred← citeshttps://doi.org/10.1007/s11227-018-2295-8openalex-snapshot
The panpositionable panconnectedness of crossed cubes
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.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.aml.2010.09.009openalex-snapshot
The automorphism group of the alternating group graph
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.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.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.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.1080/00207160.2010.495154openalex-snapshot
Conditional matching preclusion for the alternating group graphs and split-stars
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/tc.2012.15openalex-snapshot
Conditional Diagnosability of Alternating Group Graphs
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.