On the public citation graph

On the fault-tolerant diameter and wide diameter of ?-connected graphs

0 signed · 21 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/(sici)1097-0037(199608)28:1<7::aid-net2>3.0.co;2-jopenalex-snapshot
2-diameter of de Bruijn graphs
inferredcites →https://doi.org/10.1002/net.3230240305openalex-snapshot
Mengerian properties, hamiltonicity, and claw‐free graphs
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4757-3387-7openalex-snapshot
Topological Structure and Analysis of Interconnection Networks
inferredcites →https://doi.org/10.1007/bf01608486openalex-snapshot
Fault-tolerant routing in circulant networks and cycle prefix networks
inferredcites →https://doi.org/10.1016/0012-365x(94)00084-vopenalex-snapshot
On the diameter vulnerability of Kautz digraphs
inferredcites →https://doi.org/10.1016/0898-1221(87)90085-xopenalex-snapshot
Fault diameter of interconnection networks
inferredcites →https://doi.org/10.1109/12.2234openalex-snapshot
Topological properties of hypercubes
inferredcites →https://doi.org/10.11650/twjm/1500407056openalex-snapshot
WIDE DIAMETERS OF BUTTERFLY NETWORKS

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.21456openalex-snapshot
Property Pd,m and efficient design of reliable networks
inferred← citeshttps://doi.org/10.1007/s10479-015-1992-4openalex-snapshot
On robust clusters of minimum cardinality in networks
inferred← citeshttps://doi.org/10.1016/j.aam.2009.01.005openalex-snapshot
Edge, vertex and mixed fault diameters
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.020openalex-snapshot
Mixed fault diameter of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.025openalex-snapshot
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.dam.2015.02.003openalex-snapshot
Topological properties on the diameters of the integer simplex
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113678openalex-snapshot
Edge-fault diameter of C4-free graphs
inferred← citeshttps://doi.org/10.1063/5.0148991openalex-snapshot
Resilience measures in christmas trees
inferred← citeshttps://doi.org/10.1109/icccs61882.2024.10603274openalex-snapshot
The Wide Diameter of the Strong Product Graphs of Star Graphs and Cycles
inferred← citeshttps://doi.org/10.1109/icicn59530.2023.10392303openalex-snapshot
The Wide Diameter of Strong Product Graphs of Complete Graphs and any 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/s0129054123500107openalex-snapshot
The Wide Diameter and Fault Diameter of Exchanged Crossed Cube
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.