On the public citation graph
Sufficient conditions for graphs to be lambda '-optimal and super-lambda '
0 signed · 38 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(199803)31:2<61::aid-net1>3.0.co;2-hopenalex-snapshot
Reliability analysis of circulant graphs
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/jgt.20150openalex-snapshot
Sufficient conditions for λ′‐optimality in graphs with girth g
inferredcites →https://doi.org/10.1002/net.20056openalex-snapshot
On restricted connectivities of permutation graphs
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf02760258openalex-snapshot
An extremal problem in graph theory
inferredcites →https://doi.org/10.1007/s00373-005-0600-9openalex-snapshot
Super Restricted Edge Connectivity of 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.1016/j.dam.2003.06.003openalex-snapshot
On the construction of most reliable networks
inferredcites →https://doi.org/10.1016/j.disc.2004.01.008openalex-snapshot
Sufficient conditions for λ′-optimality in graphs of diameter 2
inferredcites →https://doi.org/10.1016/j.disc.2004.08.011openalex-snapshot
Super restricted edge-connectivity of vertex-transitive graphs
inferredcites →https://doi.org/10.1016/j.ipl.2005.05.006openalex-snapshot
Sufficient conditions for λ′ -optimality of graphs with small conditional diameter
inferredcites →https://doi.org/10.1016/s0012-365x(01)00232-1openalex-snapshot
On restricted edge-connectivity of graphs
inferredcites →https://doi.org/10.1016/s0012-365x(02)00299-6openalex-snapshot
Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
inferredcites →https://doi.org/10.1016/s0012-365x(02)00385-0openalex-snapshot
Edge-cuts leaving components of order at least three
inferredcites →https://doi.org/10.1016/s0012-365x(02)00675-1openalex-snapshot
Optimally super-edge-connected transitive 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.1109/12.262126openalex-snapshot
Conditional connectivity measures for large multiprocessor systems
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.1007/978-3-319-21398-9_49openalex-snapshot
Bounds for the Super Extra Edge Connectivity of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-010-0966-1openalex-snapshot
The k-Restricted Edge Connectivity of Balanced Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s10623-011-9594-xopenalex-snapshot
Codes from incidence matrices of graphs
inferred← citeshttps://doi.org/10.1007/s11859-014-1000-xopenalex-snapshot
Super-edge-connectivity of G( k, d, s)(s ⩾ k/2)
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.2011.12.004openalex-snapshot
Super restricted edge connectivity of regular edge-transitive graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.030openalex-snapshot
Super restricted edge-connectivity of graphs with diameter 2
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.027openalex-snapshot
Degree conditions for graphs to be maximally k -restricted edge connected and super k -restricted edge connected
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.2008.09.051openalex-snapshot
Degree conditions for graphs to be λ3 -optimal and super- λ3
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.008openalex-snapshot
Sufficient conditions for maximally restricted edge connected graphs
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.2009.08.005openalex-snapshot
The restricted arc connectivity of Cartesian product digraphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.10.005openalex-snapshot
Super-connected but not super edge-connected graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.05.003openalex-snapshot
λ ′ -Optimality of Bipartite Digraphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.09.005openalex-snapshot
Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.07.002openalex-snapshot
Vulnerability of super extra edge-connected 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.