On the public citation graph
On super connectivity of Cartesian product graphs
0 signed · 39 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.3190080406openalex-snapshot
Circulants and their connectivities
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.1002/net.20056openalex-snapshot
On restricted connectivities of permutation graphs
inferredcites →https://doi.org/10.1002/net.20124openalex-snapshot
Reliability of interconnection networks modeled by a product of graphs
inferredcites →https://doi.org/10.1002/net.3230100206openalex-snapshot
Complexity of network reliability computations
inferredcites →https://doi.org/10.1007/978-1-4419-8698-6openalex-snapshot
Theory and Application of Graphs
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(77)90145-5openalex-snapshot
A characterization of hypercubes
inferredcites →https://doi.org/10.1016/0012-365x(92)00475-7openalex-snapshot
Extraconnectivity of graphs with large girth
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.disc.2006.07.016openalex-snapshot
On the restricted connectivity and superconnectivity in graphs with given girth
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(96)00218-xopenalex-snapshot
Extraconnectivity of graphs with large minimum degree and girth
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.1080/00207168808803618openalex-snapshot
The number of spanning trees of the regular networks
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.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
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.1007/978-3-032-07035-7_9openalex-snapshot
Constellation: Peer-to-Peer Overlays for Federated Byzantine Agreement Systems
inferred← citeshttps://doi.org/10.1007/s00373-014-1437-xopenalex-snapshot
Restricted Connectivity for Some Interconnection Networks
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.2013.06.005openalex-snapshot
On average connectivity of the strong product of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.02.002openalex-snapshot
On the reliability of generalized Petersen graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.036openalex-snapshot
Super connectivity of Kronecker product of complete bipartite graphs and complete 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.2010.10.005openalex-snapshot
Super-connected but not super edge-connected graphs
inferred← citeshttps://doi.org/10.1051/ro/2020004openalex-snapshot
The super-connectivity of odd graphs and of their kronecker double cover
inferred← citeshttps://doi.org/10.1051/ro/2022085openalex-snapshot
On the super connectivity of direct product of graphs
inferred← citeshttps://doi.org/10.1080/09728600.2023.2218443openalex-snapshot
Under which conditions is λ″(G)=κ″(L(G)) ?
inferred← citeshttps://doi.org/10.1080/17445760.2011.650696openalex-snapshot
Extra edge connectivity of hypercube-like networks
inferred← citeshttps://doi.org/10.1080/17445760.2019.1659259openalex-snapshot
Cyclic vertex-connectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.1080/23799927.2021.1974567openalex-snapshot
Super connectivity of a family of direct product graphs
inferred← citeshttps://doi.org/10.1142/s1793830922501750openalex-snapshot
On k-restricted connectivity of direct product of graphs
inferred← citeshttps://doi.org/10.33401/fujma.975352openalex-snapshot
The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.3390/sym14091900openalex-snapshot
The g-Extra Connectivity of the Strong Product of Paths and Cycles
inferred← citeshttps://doi.org/10.7151/dmgt.2051openalex-snapshot
The super-connectivity of Kneser 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.