On the public citation graph
On restricted connectivities of permutation graphs
0 signed · 36 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.1016/0012-365x(94)00369-topenalex-snapshot
On the extraconnectivity 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/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/s0012-365x(02)00870-1openalex-snapshot
Distance and connectivity measures in permutation graphs
inferredcites →https://doi.org/10.1016/s0012-365x(96)00218-xopenalex-snapshot
Extraconnectivity of graphs with large minimum degree and girth
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/net.20124openalex-snapshot
Reliability of interconnection networks modeled by a product of graphs
inferred← citeshttps://doi.org/10.1002/net.20173openalex-snapshot
Sufficient conditions for graphs to be lambda '-optimal and super-lambda '
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.20343openalex-snapshot
Neighborhood conditions for graphs to be super restricted edge connected
inferred← citeshttps://doi.org/10.1007/s00373-010-0919-8openalex-snapshot
Connectivity of Strong Products of Graphs
inferred← citeshttps://doi.org/10.1007/s10114-015-4160-5openalex-snapshot
The fractional metric dimension of permutation graphs
inferred← citeshttps://doi.org/10.1007/s12190-014-0755-8openalex-snapshot
On the geodetic number of permutation graphs
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.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.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.disc.2007.04.051openalex-snapshot
Connectivity measures in matched sum 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.2007.10.008openalex-snapshot
Some remarks on λp,q -connectedness
inferred← citeshttps://doi.org/10.1016/j.disc.2008.01.037openalex-snapshot
Sufficient conditions for super k -restricted edge connectivity in graphs of diameter 2
inferred← citeshttps://doi.org/10.1016/j.endm.2006.08.017openalex-snapshot
Highly connected star product graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.10.012openalex-snapshot
A neighborhood condition for graphs to be maximally k-restricted edge connected
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.08.018openalex-snapshot
Sufficient conditions for k-restricted edge connected graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.025openalex-snapshot
On the broadcast domination number of permutation graphs
inferred← citeshttps://doi.org/10.1142/s1793830917500094openalex-snapshot
Disjunctive total domination in permutation graphs
inferred← citeshttps://doi.org/10.12677/aam.2019.83043openalex-snapshot
Sufficient Conditions for Graphs to Be Maximally 3-Restricted Edge-Connected
inferred← citeshttps://doi.org/10.33915/etd.11410openalex-snapshot
On Generalizations of Supereulerian Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2051openalex-snapshot
The super-connectivity of Kneser 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.