On the public citation graph

Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)‐star graphs

https://doi.org/10.1002/net.10096
0 signed · 68 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.6openalex-snapshot
On the construction of combinedk‐fault‐tolerant Hamiltonian graphs
inferredcites →https://doi.org/10.1006/jpdc.2001.1813openalex-snapshot
Fault-Tolerant Hamiltonicity of Twisted Cubes
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4612-0933-1openalex-snapshot
Graph Theory Applications
inferredcites →https://doi.org/10.1016/0020-0190(95)00162-1openalex-snapshot
The (n, k)-star graph: A generalized star graph
inferredcites →https://doi.org/10.1109/71.755822openalex-snapshot
Fault-free Hamiltonian cycles in faulty arrangement graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.8059openalex-snapshot
A recurrence for the surface area of the (n,k)$$ \left(n,k\right) $$‐star graph
inferred← citeshttps://doi.org/10.1002/net.20187openalex-snapshot
Matching preclusion for some interconnection networks
inferred← citeshttps://doi.org/10.1002/net.20440openalex-snapshot
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
inferred← citeshttps://doi.org/10.1007/978-94-007-1839-5_55openalex-snapshot
A Fault-Tolerance Shortest Routing Algorithm with PDPE on (n, k)-Star Graph for NoC
inferred← citeshttps://doi.org/10.1007/s00026-009-0011-3openalex-snapshot
Mutually Independent Hamiltonian Connectivity of (n, k)-Star Graphs
inferred← citeshttps://doi.org/10.1007/s00373-016-1741-8openalex-snapshot
On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1871-7openalex-snapshot
A Complete Classification of Which (n, k)-Star Graphs are Cayley Graphs
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/s40305-025-00667-zopenalex-snapshot
Two-Disjoint-Cycle-Cover Pancyclicity of (n, k)-Star Graph
inferred← citeshttps://doi.org/10.1016/j.amc.2012.03.021openalex-snapshot
The conditional fault diagnosability of (n,k)-star graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2014.10.006openalex-snapshot
Fault-tolerance of (n,k) -star networks
inferred← citeshttps://doi.org/10.1016/j.amc.2016.12.015openalex-snapshot
A kind of conditional connectivity of Cayley graphs generated by wheel graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127638openalex-snapshot
Integer k -matching preclusion of twisted cubes and ( n,s )-star graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2026.130218openalex-snapshot
Fault Hamiltonicity and fault Hamiltonian connectivity of (n, k)-bubble sort graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.08.013openalex-snapshot
One-to-many node-disjoint paths in (n,k) -star graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.040openalex-snapshot
Matching preclusion and conditional matching preclusion for regular interconnection networks
inferred← citeshttps://doi.org/10.1016/j.disc.2005.08.011openalex-snapshot
Cubic planar hamiltonian graphs of various types
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.2007.09.014openalex-snapshot
Constructing vertex–disjoint paths in (n, k)-star graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2010.03.006openalex-snapshot
Two-node-Hamiltonicity of enhanced pyramid networks
inferred← citeshttps://doi.org/10.1016/j.ins.2011.05.010openalex-snapshot
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
inferred← citeshttps://doi.org/10.1016/j.ins.2014.02.087openalex-snapshot
Fault-tolerant hamiltonian connectivity of the WK-recursive networks
inferred← citeshttps://doi.org/10.1016/j.ins.2014.06.046openalex-snapshot
Edge-fault-tolerant pancyclicity of arrangement graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.08.015openalex-snapshot
A kind of conditional fault tolerance of -star graphs
inferred← citeshttps://doi.org/10.1016/j.mcm.2007.11.007openalex-snapshot
Hamiltonian connectivity of 2-tree-generated networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.035openalex-snapshot
Weak-vertex-pancyclicity of (n, k)-star graphs
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.2015.11.051openalex-snapshot
Strong matching preclusion of (n,k)-star graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.050openalex-snapshot
Matching preclusion number in product graphs
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.1051/ro/2024064openalex-snapshot
Integer k-matching preclusion of graphs
inferred← citeshttps://doi.org/10.1080/00207160701684485openalex-snapshot
Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
inferred← citeshttps://doi.org/10.1080/00207160902883514openalex-snapshot
Matching preclusion for the (n, k)-bubble-sort graphs
inferred← citeshttps://doi.org/10.1080/02533839.2026.2626277openalex-snapshot
The cyclic diagnosability of (n,k) -bubble-sort network and (n,k)-star network
inferred← citeshttps://doi.org/10.1093/comjnl/bxz077openalex-snapshot
A Kind Of Conditional Vertex Connectivity Of Cayley Graphs Generated By Wheel Graphs
inferred← citeshttps://doi.org/10.1109/access.2017.2773144openalex-snapshot
Structural Properties and $t/s$ -Diagnosis for Star Networks Based on the PMC Model
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.2020.3025009openalex-snapshot
Two Algorithms for Constructing Independent Spanning Trees in (n,k)-Star Graphs
inferred← citeshttps://doi.org/10.1109/candar57322.2022.00011openalex-snapshot
A Recurrence for the Surface Area of the ($n, k$)-Star Graph
inferred← citeshttps://doi.org/10.1109/i-span.2009.116openalex-snapshot
Fault-Tolerant Hamiltonicity of the WK-Recursive Networks
inferred← citeshttps://doi.org/10.1109/i-span.2009.141openalex-snapshot
A Fault-Tolerant Routing Algorithm with Safety Vectors on the (n, k)-Star Graph
inferred← citeshttps://doi.org/10.1109/i-span.2018.00046openalex-snapshot
Structure Connectivity and Substructure Connectivity of (n, k)-Star Graph Networks
inferred← citeshttps://doi.org/10.1109/iccse.2010.5593645openalex-snapshot
Fault tolerance of (n, k)-Star Graphs
inferred← citeshttps://doi.org/10.1109/icise.2010.5690258openalex-snapshot
The conditional fault tolerance of (n,2)-star graph
inferred← citeshttps://doi.org/10.1109/icma.2016.7558577openalex-snapshot
Conditional fault tolerance properties of (n, k)-star graphs
inferred← citeshttps://doi.org/10.1109/infoseee.2014.6948114openalex-snapshot
Generalized edge-connectivity of (n, k)-star graphs
inferred← citeshttps://doi.org/10.1109/tdsc.2016.2562620openalex-snapshot
Conditional Diagnosability of $(n,k)$ -Star Graphs Under the PMC Model
inferred← citeshttps://doi.org/10.1109/tnet.2020.3002093openalex-snapshot
Conditional Diagnosability of Alternating Group Networks Under the PMC Model
inferred← citeshttps://doi.org/10.1109/tr.2014.2354912openalex-snapshot
Conditional Diagnosability of $(n,k)$ -Star Networks Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/tr.2016.2570544openalex-snapshot
The Reliability Analysis Based on Subsystems of $(n,k)$ -Star Graph
inferred← citeshttps://doi.org/10.1142/s0129054106003905openalex-snapshot
THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
inferred← citeshttps://doi.org/10.1142/s0129054113500317openalex-snapshot
GENERALIZED CONNECTIVITY OF (n, k)-STAR GRAPHS
inferred← citeshttps://doi.org/10.1142/s0129054114500300openalex-snapshot
AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH
inferred← citeshttps://doi.org/10.1142/s0129626418500172openalex-snapshot
Fractional Matching Preclusion for (n,k)-Star Graphs
inferred← citeshttps://doi.org/10.1155/2019/8247419openalex-snapshot
Maximum Independent Sets Partition of (n, k)‐Star Graphs
inferred← citeshttps://doi.org/10.11591/telkomnika.v11i1.1901openalex-snapshot
Independent Number and Dominating Number of (n,k)-Star Graphs
inferred← citeshttps://doi.org/10.11591/telkomnika.v11i9.3285openalex-snapshot
Some Results of Bondage Number of (n,k)-Star Graphs
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.433-440.4853openalex-snapshot
The Conditional Connectivity of (n,k)-Star Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1703.06111openalex-snapshot
A complete classification of which $(n,k)$-star graphs are Cayley graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1902.03391openalex-snapshot
Embedding onto Wheel-like Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2001.03713openalex-snapshot
Fractional matching preclusion of fault Hamiltonian graphs
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.