On the public citation graph
Super edge‐ and point‐connectivities of the Cartesian product of regular graphs
0 signed · 31 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.3230150210openalex-snapshot
Combinatorial optimization problems in the analysis and design of probabilistic networks
inferredcites →https://doi.org/10.1016/0016-0032(56)90559-2openalex-snapshot
Reliable circuits using less reliable relays
inferredcites →https://doi.org/10.1080/00207168808803618openalex-snapshot
The number of spanning trees of the regular 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.262126openalex-snapshot
Conditional connectivity measures for large multiprocessor systems
inferredcites →https://doi.org/10.1109/31.7582openalex-snapshot
Graph theoretic reliability analysis for the Boolean n cube networks
inferredcites →https://doi.org/10.1109/tc.1985.1676608openalex-snapshot
A Regular Fault-Tolerant Architecture for Interconnection Networks
inferredcites →https://doi.org/10.1137/0212053openalex-snapshot
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
inferredcites →https://doi.org/10.2307/2287146openalex-snapshot
The Theory and Applications of 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/net.20149openalex-snapshot
On super edge‐connectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.1002/net.20224openalex-snapshot
On super connectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.1007/s00373-005-0600-9openalex-snapshot
Super Restricted Edge Connectivity of Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1437-xopenalex-snapshot
Restricted Connectivity for Some Interconnection Networks
inferred← citeshttps://doi.org/10.1007/s41980-021-00641-4openalex-snapshot
Connectivity of Cartesian Product of Hypergraphs
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.dam.2007.06.014openalex-snapshot
On the edge-connectivity and restricted edge-connectivity of a product of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.02.004openalex-snapshot
Double-super-connected digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.033openalex-snapshot
Edge fault tolerance of graphs with respect to super edge connectivity
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.disc.2007.06.035openalex-snapshot
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2010.12.012openalex-snapshot
On optimizing edge connectivity of product graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2026.100970openalex-snapshot
The restricted edge-connectivity of the Cartesian product of graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.04.006openalex-snapshot
Super-connected and super-arc-connected Cartesian product of digraphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.02.025openalex-snapshot
Super restricted edge connected Cartesian product graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.05.013openalex-snapshot
Super connectivity of Kronecker products of graphs
inferred← citeshttps://doi.org/10.1080/17445760.2019.1659259openalex-snapshot
Cyclic vertex-connectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.1109/icnds.2010.5479264openalex-snapshot
On super 3-restricted edge connectivity of regular strong product graphs with girth at least four
inferred← citeshttps://doi.org/10.1155/2014/750618openalex-snapshot
The Number of Spanning Trees of the Cartesian Product of Regular Graphs
inferred← citeshttps://doi.org/10.1541/ieejeiss.128.1023openalex-snapshot
Clinical Experiments of Communication by ALS Patient Utilizing Detecting Event-Related Potential
inferred← citeshttps://doi.org/10.3390/axioms13040231openalex-snapshot
The Restricted Edge-Connectivity of Strong Product Graphs
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.