On the public citation graph
Generalized measures for fault tolerance of star networks
0 signed · 64 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/net.10045openalex-snapshot
Increasing the connectivity of the star graphs
inferredcites →https://doi.org/10.1006/jpdc.1996.0028openalex-snapshot
Conditional Fault Diameter of Star Graph Networks
inferredcites →https://doi.org/10.1007/978-3-642-28073-3_29openalex-snapshot
A New Hierarchical Structure of Star Graphs and Applications
inferredcites →https://doi.org/10.1007/bf02671131openalex-snapshot
On conditional edge-connectivity of graphs
inferredcites →https://doi.org/10.1016/j.aml.2008.03.021openalex-snapshot
A kind of conditional vertex connectivity of star graphs
inferredcites →https://doi.org/10.1016/j.dam.2007.12.005openalex-snapshot
Strong structural properties of unidirectional star graphs
inferredcites →https://doi.org/10.1016/j.ins.2007.09.013openalex-snapshot
Robustness of star graph network under link failure
inferredcites →https://doi.org/10.1016/j.ins.2010.03.002openalex-snapshot
Improving bounds on link failure tolerance of the star graph
inferredcites →https://doi.org/10.1016/j.ipl.2006.12.013openalex-snapshot
A study of fault tolerance in star graph
inferredcites →https://doi.org/10.1016/j.ipl.2010.09.001openalex-snapshot
Conditional connectivity of Cayley graphs generated by transposition trees
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.262126openalex-snapshot
Conditional connectivity measures for large multiprocessor systems
inferredcites →https://doi.org/10.1109/12.42131openalex-snapshot
Generalized measures of fault tolerance with application to N-cube networks
inferredcites →https://doi.org/10.1109/12.707589openalex-snapshot
Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
inferredcites →https://doi.org/10.1109/71.242153openalex-snapshot
Generalized measures of fault tolerance in n-cube networks
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.1142/s0129054197000112openalex-snapshot
Fault Tolerance on Star Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10255-017-0708-8openalex-snapshot
Conditional connectivity of bubble sort graphs
inferred← citeshttps://doi.org/10.1007/s11227-022-04522-3openalex-snapshot
Embedded connectivity of some BC networks
inferred← citeshttps://doi.org/10.1007/s11227-022-05036-8openalex-snapshot
On structure and substructure fault tolerance of star networks
inferred← citeshttps://doi.org/10.1007/s11227-023-05368-zopenalex-snapshot
Hybrid fault g-good-neighbor conditional diagnosability of star graphs
inferred← citeshttps://doi.org/10.1007/s11464-017-0657-9openalex-snapshot
g-good-neighbor conditional diagnosability of star graph networks under PMC model and MM* model
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.2019.124630openalex-snapshot
Generalized measures of fault tolerance for bubble sort networks
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126845openalex-snapshot
Note on reliability evaluation of arrangement graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129399openalex-snapshot
Reliability evaluation of conditional recursive networks under h-conditional restriction
inferred← citeshttps://doi.org/10.1016/j.dam.2015.09.002openalex-snapshot
The restricted h -connectivity of the data center network DCell
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.047openalex-snapshot
The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.021openalex-snapshot
Equal relation between g -good-neighbor diagnosability under the PMC model and g -good-neighbor diagnosability under the MM ∗ model of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2020.04.009openalex-snapshot
Structure connectivity and substructure connectivity of star graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.05.016openalex-snapshot
The fault tolerance of (n,k) -bubble-sort networks
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.020openalex-snapshot
On g -good-neighbor conditional connectivity and diagnosability of hierarchical star networks
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.013openalex-snapshot
The 1-good neighbor connectivity of unidirectional star graph networks
inferred← citeshttps://doi.org/10.1016/j.dam.2021.10.012openalex-snapshot
Reliability assessment for modified bubble-sort networks
inferred← citeshttps://doi.org/10.1016/j.dam.2022.11.012openalex-snapshot
Restricted connectivity of Cayley graph generated by transposition trees
inferred← citeshttps://doi.org/10.1016/j.dam.2023.02.016openalex-snapshot
Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
inferred← citeshttps://doi.org/10.1016/j.dam.2026.05.019openalex-snapshot
Generalized fault-tolerance measures in pancake networks and their variants
inferred← citeshttps://doi.org/10.1016/j.dam.2026.05.036openalex-snapshot
Fault tolerance evaluation of a new of recursive network
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.08.003openalex-snapshot
Reliability of arrangement networks in terms of the h-restricted edge connectivity
inferred← citeshttps://doi.org/10.1016/j.jpdc.2024.104886openalex-snapshot
Reliability assessment for k-ary n-cubes with faulty edges
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.09.022openalex-snapshot
Embedded connectivity of recursive networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.011openalex-snapshot
The g-good-neighbor conditional diagnosability of star graphs under the PMC and MM* model
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.031openalex-snapshot
On g-good-neighbor conditional diagnosability of (n,k)-star networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.004openalex-snapshot
On fault tolerance of (n,k)-star networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.07.018openalex-snapshot
A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.07.021openalex-snapshot
On conditional fault tolerance of hierarchical cubic networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.001openalex-snapshot
The extra connectivity and extra diagnosability of regular interconnection networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.016openalex-snapshot
Embedded connectivity of ternary n-cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.05.028openalex-snapshot
Note on reliability of star graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114173openalex-snapshot
Matroidal connectivity and conditional matroidal connectivity of star graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114927openalex-snapshot
Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115534openalex-snapshot
The diagnosability of multiprocessor systems under the enhanced comparison model
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115863openalex-snapshot
The h-extra r-component edge connectivity of star networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxw037openalex-snapshot
The 2-Extra Connectivity and 2-Extra Diagnosability of Bubble-Sort Star Graph Networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxw078openalex-snapshot
Reliability of Complete Cubic Networks under the Condition ofg-Good-Neighbor
inferred← citeshttps://doi.org/10.1093/comjnl/bxy077openalex-snapshot
The strong connectivity of bubble-sort star graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxz083openalex-snapshot
Characterization of Diagnosabilities on the Bounded PMC Model
inferred← citeshttps://doi.org/10.1109/tpds.2021.3126257openalex-snapshot
FFNLFD: Fault Diagnosis of Multiprocessor Systems at Local Node with Fault-Free Neighbors under PMC Model and MM* Model
inferred← citeshttps://doi.org/10.1109/tr.2017.2760905openalex-snapshot
The Relationship Between $g$ -Restricted Connectivity and $g$-Good-Neighbor Fault Diagnosability of General Regular Networks
inferred← citeshttps://doi.org/10.1109/tr.2019.2919282openalex-snapshot
On Reliability of Multiprocessor System Based on Star Graph
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.1142/s0129054124500205openalex-snapshot
Enhancing Reliability of Folded Petersen Networks Based on Edge Partition
inferred← citeshttps://doi.org/10.3390/sym17060918openalex-snapshot
The Reliability of Cayley Graphs Generated by Transposition Trees Based on Edge Failures
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.