On the public citation graph

On conditional edge-connectivity of graphs

https://doi.org/10.1007/bf02671131
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.
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(199803)31:2<61::aid-net1>3.0.co;2-hopenalex-snapshot
Reliability analysis of circulant graphs
inferredcites →https://doi.org/10.1002/net.3230130303openalex-snapshot
Conditional connectivity
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/s11766-999-0047-5openalex-snapshot
Some results on R 2-edge-connectivity of even regular 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.1090/dimacs/021/18openalex-snapshot
Restricted connectivity and restricted fault diameter of some interconnection networks
inferredcites →https://doi.org/10.1109/12.262126openalex-snapshot
Conditional connectivity measures for large multiprocessor systems
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/12.707589openalex-snapshot
Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
inferredcites →https://doi.org/10.1109/12.736433openalex-snapshot
New low-complexity bit-parallel finite field multipliers using weakly dual bases

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.21539openalex-snapshot
Generalized measures for fault tolerance of star networks
inferred← citeshttps://doi.org/10.1007/s10114-013-2255-4openalex-snapshot
Super cyclically edge-connected vertex-transitive graphs of girth at least 5
inferred← citeshttps://doi.org/10.1007/s10878-014-9759-4openalex-snapshot
Atoms of cyclic edge connectivity in regular graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2012.11.002openalex-snapshot
Optimizing algebraic connectivity by edge rewiring
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124630openalex-snapshot
Generalized measures of fault tolerance for bubble sort networks
inferred← citeshttps://doi.org/10.1016/j.amc.2024.128558openalex-snapshot
A novel edge connectivity based on edge partition for hypercube and folded hypercube
inferred← citeshttps://doi.org/10.1016/j.aml.2011.11.040openalex-snapshot
Generalized measures of fault tolerance in hypercube networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2013.03.006openalex-snapshot
Robustness study of emerged communities from exchanges in peer-to-peer networks
inferred← citeshttps://doi.org/10.1016/j.dam.2021.10.012openalex-snapshot
Reliability assessment for modified bubble-sort networks
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.013openalex-snapshot
Reliability analysis of 3-ary n -cube in terms of average degree edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.dam.2025.05.011openalex-snapshot
Conditional matroidal edge connectivity of Cayley graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.019openalex-snapshot
On cyclic edge-connectivity of transitive graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.03.001openalex-snapshot
-Optimally half vertex transitive graphs with regularity k
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.04.007openalex-snapshot
Generalized measures of fault tolerance in exchanged hypercubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.07.010openalex-snapshot
Edge-fault tolerance of hypercube-like networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.07.002openalex-snapshot
Vulnerability of super extra edge-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.08.003openalex-snapshot
Reliability of arrangement networks in terms of the h-restricted edge connectivity
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.09.022openalex-snapshot
Embedded connectivity of recursive networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.07.021openalex-snapshot
On conditional fault tolerance of hierarchical cubic networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.012openalex-snapshot
The generalized measure of edge fault tolerance in exchanged crossed cube
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00232-1openalex-snapshot
On restricted edge-connectivity of graphs
inferred← citeshttps://doi.org/10.1049/cje.2016.05.023openalex-snapshot
On Conditional h ‐Vertex Connectivity of Some Networks
inferred← citeshttps://doi.org/10.1080/03081087.2016.1277689openalex-snapshot
On computing of a conditional edge connectivity of alternating group network
inferred← citeshttps://doi.org/10.1080/17445760.2023.2172575openalex-snapshot
The generalized measure of edge fault tolerance in exchanged 3-aryn-cube
inferred← citeshttps://doi.org/10.1080/23799927.2026.2686099openalex-snapshot
The h -connectivity of incremental scalability exchanged hypercube
inferred← citeshttps://doi.org/10.1093/comjnl/bxac064openalex-snapshot
The a-average Degree Edge-Connectivity of Bijective Connection Networks
inferred← citeshttps://doi.org/10.1109/tr.2024.3410526openalex-snapshot
A Novel Links Fault Tolerant Analysis: $g$-Good $r$-Component Edge-Connectivity of Interconnection Networks With Applications to Hypercubes
inferred← citeshttps://doi.org/10.1142/s0219265921500079openalex-snapshot
A Note on Conditional Edge Connectivity of Hypercube Networks
inferred← citeshttps://doi.org/10.1142/s179383091750032xopenalex-snapshot
On 4-regular 4-connected bipancyclic subgraphs of hypercubes
inferred← citeshttps://doi.org/10.1504/ijitst.2010.037406openalex-snapshot
Characterising the robustness of complex networks
inferred← citeshttps://doi.org/10.4108/icst.bionetics2008.4713openalex-snapshot
ELASTICITY: Topological Characterization of Robustness in Complex Networks
inferred← citeshttps://doi.org/10.4236/am.2013.42053openalex-snapshot
Super Cyclically Edge Connected Half Vertex Transitive Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0811.3272openalex-snapshot
Characterizing the Robustness of Complex Networks
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.