English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A set S ⊆ V (G) is a vertex k-cut in a graph G = (V (G), E(G)) if G− S has at least k connected components. The k-connectivity of G, denoted as κk(G), is the minimum cardinality of a vertex k-cut in G. We give several constructions of a set S such that (G2H)− S has at least three connected components. Then we prove that for any 2-connected graphs G and H, of order at least six, one of the defined sets S is a minimum vertex 3-cut in G2H. This yields a formula for κ3(G2H).

Separation of Cartesian products of graphs into several connected components by the removal of vertices