On the public citation graph
On super edge‐connectivity of Cartesian product graphs
0 signed · 43 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/jgt.20053openalex-snapshot
Sufficient conditions for graphs to be λ′‐optimal, super‐edge‐connected, and maximally edge‐connected
inferredcites →https://doi.org/10.1002/net.10037openalex-snapshot
Super edge‐ and point‐connectivities of the Cartesian product of regular graphs
inferredcites →https://doi.org/10.1007/978-1-4419-8698-6openalex-snapshot
Theory and Application of Graphs
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/s10255-005-0283-2openalex-snapshot
Super Connectivity of Line Graphs and Digraphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90154-xopenalex-snapshot
Results on the edge-connectivity of graphs
inferredcites →https://doi.org/10.1016/0020-0190(88)90025-7openalex-snapshot
On computing a conditional edge-connectivity of a graph
inferredcites →https://doi.org/10.1016/j.ipl.2005.02.001openalex-snapshot
Super connectivity of line graphs
inferredcites →https://doi.org/10.1016/s0012-365x(01)00232-1openalex-snapshot
On restricted edge-connectivity of 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.1016/s0166-218x(00)00337-1openalex-snapshot
On a kind of restricted edge connectivity of graphs
inferredcites →https://doi.org/10.1080/00207168808803618openalex-snapshot
The number of spanning trees of the regular networks
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/31.7582openalex-snapshot
Graph theoretic reliability analysis for the Boolean n cube 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.20231openalex-snapshot
Reliability of interconnection networks modeled by Cartesian product digraphs
inferred← citeshttps://doi.org/10.1007/s11227-024-06197-4openalex-snapshot
Three kinds of connectivity of folded spined cubes
inferred← citeshttps://doi.org/10.1007/s40840-020-00999-4openalex-snapshot
Some Results About the Reliability of Folded Hypercubes
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.amc.2012.06.077openalex-snapshot
Super connectivity of balanced hypercubes
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.2021.02.017openalex-snapshot
A new approach to finding the extra connectivity of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.022openalex-snapshot
Super connectivity of folded twisted crossed cubes
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.2007.12.073openalex-snapshot
Super edge-connectivity of mixed Cayley graph
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.015openalex-snapshot
Forbidden subgraphs generating a finite set
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.ins.2009.05.005openalex-snapshot
Super p-restricted edge connectivity of line graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.10.005openalex-snapshot
The super connectivity of augmented cubes
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.2011.01.006openalex-snapshot
The super connectivity of exchanged hypercubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.10.003openalex-snapshot
The super connectivity of exchanged crossed cube
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.10.013openalex-snapshot
The super connectivity of folded crossed cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.021openalex-snapshot
Vulnerability of super edge-connected networks
inferred← citeshttps://doi.org/10.1080/00207160.2015.1067690openalex-snapshot
The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes
inferred← citeshttps://doi.org/10.1080/00207160.2016.1148813openalex-snapshot
On extra connectivity and extra edge-connectivity of balanced hypercubes
inferred← citeshttps://doi.org/10.1109/acit-csi.2015.56openalex-snapshot
Super Connectivity of Component-Composition Networks
inferred← citeshttps://doi.org/10.1109/tc.2014.2304391openalex-snapshot
Symmetric Property and Reliability of Balanced Hypercube
inferred← citeshttps://doi.org/10.1142/s0219265917500074openalex-snapshot
Super Edge-Connectivity of Strong Product Graphs
inferred← citeshttps://doi.org/10.1142/s179383091000053xopenalex-snapshot
ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS
inferred← citeshttps://doi.org/10.15826/umj.2024.2.006openalex-snapshot
GRAPHICAL PROPERTIES OF CLUSTERED GRAPHS
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.