On the public citation graph
Reliability of interconnection networks modeled by a product of graphs
0 signed · 29 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/(sici)1097-0037(199905)33:3<161::aid-net1>3.0.co;2-3openalex-snapshot
On diameter of permutation graphs
inferredcites →https://doi.org/10.1002/jgt.3190080406openalex-snapshot
Circulants and their connectivities
inferredcites →https://doi.org/10.1002/jgt.3190090304openalex-snapshot
Large bipartite graphs with given degree and diameter
inferredcites →https://doi.org/10.1002/net.20056openalex-snapshot
On restricted connectivities of permutation graphs
inferredcites →https://doi.org/10.1006/jctb.1998.1828openalex-snapshot
A Note on Large Graphs of Diameter Two and Given Maximum Degree
inferredcites →https://doi.org/10.1016/0095-8956(84)90012-1openalex-snapshot
Large graphs with given degree and diameter. II
inferredcites →https://doi.org/10.1016/0166-218x(91)90047-zopenalex-snapshot
Connectivity of generalized prisms over G
inferredcites →https://doi.org/10.1016/0166-218x(94)00131-vopenalex-snapshot
Large survivable nets and the generalized prisms
inferredcites →https://doi.org/10.1016/j.disc.2005.11.010openalex-snapshot
Connectivity of Cartesian product graphs
inferredcites →https://doi.org/10.1016/s0012-365x(02)00870-1openalex-snapshot
Distance and connectivity measures in permutation graphs
inferredcites →https://doi.org/10.1016/s0096-3003(98)10041-3openalex-snapshot
On connectivity of the Cartesian product of two graphs
inferredcites →https://doi.org/10.1109/tr.1986.4335424openalex-snapshot
Synthesis of reliable networks - a survey
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.1002/net.20224openalex-snapshot
On super connectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.1002/net.20231openalex-snapshot
Reliability of interconnection networks modeled by Cartesian product digraphs
inferred← citeshttps://doi.org/10.1002/net.21977openalex-snapshot
Network reliability: Heading out on the highway
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.amc.2008.10.035openalex-snapshot
On super edge-connectivity of product graphs
inferred← citeshttps://doi.org/10.1016/j.aml.2010.03.013openalex-snapshot
Cyclic arc-connectivity in a Cartesian product digraph
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.010openalex-snapshot
On the 3-restricted edge connectivity of permutation graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.001openalex-snapshot
The k -restricted edge-connectivity of a product of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.06.005openalex-snapshot
On average connectivity of the strong product of graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.01.001openalex-snapshot
Fault diameter of product graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.03.014openalex-snapshot
The connectivity of generalized graph products
inferred← citeshttps://doi.org/10.2298/aadm160719018sopenalex-snapshot
Separation of Cartesian products of graphs into several connected components by the removal of edges
inferred← citeshttps://doi.org/10.2298/aadm160726003aopenalex-snapshot
On generalized 3-connectivity of the strong product of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2505openalex-snapshot
Spanning trails avoiding and containing given edges
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.