On the public citation graph

Minimal fault diameter for highly resilient product networks

0 signed · 49 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.1016/0020-0190(93)90060-mopenalex-snapshot
On the fault-diameter of the star graph
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/0898-1221(87)90085-xopenalex-snapshot
Fault diameter of interconnection networks
inferredcites →https://doi.org/10.1109/12.192211openalex-snapshot
Combinatorial analysis of the fault-diameter of the n-cube
inferredcites →https://doi.org/10.1109/12.2234openalex-snapshot
Topological properties of hypercubes
inferredcites →https://doi.org/10.1109/12.403718openalex-snapshot
Lee distance and topological properties of k-ary n-cubes
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/24.229494openalex-snapshot
A general framework for developing adaptive fault-tolerant routing algorithms
inferredcites →https://doi.org/10.1109/71.243525openalex-snapshot
The hyper-deBruijn networks: scalable versatile architecture
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.466633openalex-snapshot
Products of networks with logarithmic diameter and fixed degree
inferredcites →https://doi.org/10.1109/71.485505openalex-snapshot
Folded Petersen cube networks: new competitors for the hypercubes
inferredcites →https://doi.org/10.1109/71.553283openalex-snapshot
Mesh-connected trees: a bridge between grids and meshes of trees
inferredcites →https://doi.org/10.1109/71.577251openalex-snapshot
The cross product of interconnection networks
inferredcites →https://doi.org/10.1109/71.615436openalex-snapshot
Fault diameter of k-ary n-cube networks
inferredcites →https://doi.org/10.1109/71.80144openalex-snapshot
The banyan-hypercube networks
inferredcites →https://doi.org/10.1109/fmpc.1992.234949openalex-snapshot
Hyper Petersen network: yet another hypercube-like topology
inferredcites →https://doi.org/10.1109/fmpc.1995.380472openalex-snapshot
Design and analysis of product networks
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network

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.5487openalex-snapshot
On forwarding indices of lexicographic product networks
inferred← citeshttps://doi.org/10.1007/11945918_23openalex-snapshot
Capturing an Intruder in Product Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_19openalex-snapshot
Edge Fault-Diameter of Cartesian Product of Graphs
inferred← citeshttps://doi.org/10.1007/s11107-018-0806-4openalex-snapshot
On the information transmission delay of the lexicographic product of digraphs
inferred← citeshttps://doi.org/10.1016/j.aam.2007.04.005openalex-snapshot
The fault-diameter of Cartesian products
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.amc.2012.03.092openalex-snapshot
The g-good-neighbor conditional diagnosability of hypercube under PMC model
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.ejc.2008.09.004openalex-snapshot
The edge fault-diameter of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.05.010openalex-snapshot
Fault-diameter of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.01.003openalex-snapshot
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.04.013openalex-snapshot
Capturing an intruder in product networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.06.005openalex-snapshot
Resource placement in Cartesian product of networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxx053openalex-snapshot
The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars
inferred← citeshttps://doi.org/10.1109/icdcsw.2006.51openalex-snapshot
Fault-diameter of generalized Cartesian products
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00035openalex-snapshot
Edge-Disjoint Spanning Trees on Star Products
inferred← citeshttps://doi.org/10.1109/pdcat.2007.19openalex-snapshot
Distant-Based Resource Placement in Product Networks
inferred← citeshttps://doi.org/10.1109/pdcat.2007.32openalex-snapshot
Design and Analysis of a Backpressure Congestion Control Algorithm in Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/tc.2004.114openalex-snapshot
Diagnosability of t-connected networks and product networks under the comparison diagnosis model
inferred← citeshttps://doi.org/10.1109/tc.2008.30openalex-snapshot
Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/tpds.2005.98openalex-snapshot
Performance, algorithmic, and robustness attributes of perfect difference networks
inferred← citeshttps://doi.org/10.1109/tpds.2012.304openalex-snapshot
Conditional Edge-Fault Hamiltonicity of Cartesian Product Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2013.103openalex-snapshot
Hamiltonicity of Product Networks with Faulty Elements
inferred← citeshttps://doi.org/10.1109/tpds.2014.2307853openalex-snapshot
Topological Properties on the Wide and Fault Diameters of Exchanged Hypercubes
inferred← citeshttps://doi.org/10.1109/tpds.2014.2364604openalex-snapshot
Fault-Tolerant Cycle Embedding in Cartesian Product Graphs: Edge-Pancyclicity and Edge-Bipancyclicity with Faulty Edges
inferred← citeshttps://doi.org/10.26493/1855-3974.390.1c5openalex-snapshot
Mixed fault diameter of Cartesian graph bundles II
inferred← citeshttps://doi.org/10.3233/jifs-189015openalex-snapshot
Measuring lexicographic product network efficiency with small time delay
inferred← citeshttps://doi.org/10.48550/arxiv.1002.2508openalex-snapshot
Mixed connectivity of Cartesian graph products and bundles
inferred← citeshttps://doi.org/10.48550/arxiv.1212.4670openalex-snapshot
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
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.