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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A vertex subset  F   ⊆   V G is a cyclic vertex-cut of a connected graph  G if  G − F is disconnected and at least two of its components contain cycles. The cyclic vertex-connectivity  κ c G is denoted as the cardinality of a minimum cyclic vertex-cut. In this paper, we show that the cyclic vertex-connectivity of the  n , k -star network  S n , k is  κ c S n , k = n + 2 k − 5 for any integer  n ≥ 4 and  k ≥ 2 .

mathematical problems in engineering

On Cyclic-Vertex Connectivity of <math xmlns="http://www.w3.org/1998/Math/MathML" id="M1"> <mfenced open="(" close=")" separators="|"> <mrow> <mi>n</mi> <mo>,</mo> <mi>k</mi> </mrow> </mfenced> </math>-Star Graphs

On Cyclic-Vertex Connectivity of n , k -Star Graphs

On Cyclic-Vertex Connectivity of $(n, k)$ -Star Graphs