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

The exchanged 3-ary  n -cube, proposed by Lv et al. in 2021, is obtained by removing edges from a 3-ary  n -cube, where  r  +  s  +  t  + 1 =  n . The topological interconnection network of a multiprocessor system can be modeled as a connected graph. Analyzing the fault tolerance of its topological structure is critical in the course of design and maintenance of it. Given a connected graph  G , let  F  be an edge subset of  G .  F  is called an  h -edge-cut of  G , if  G − F  is disconnected and each remaining component has the minimum degree of at least  h . The  h -edge-connectivityis the minimum cardinality of all  h -edge-cuts of  G . Forand, in this paper, we determine the-edge-connectivity of exchanged 3-ary  n -cubes,, and prove the exact values.

The generalized measure of edge fault tolerance in exchanged 3-ary n -cube