☆ 4.6 Article

Disjoint paths in the enhanced hypercube with a faulty subgraph

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING (2023)

Related references

Note: Only part of the references are listed.

Article Computer Science, Hardware & Architecture

Strong Menger Connectedness of Augmented k-ary n-cubes

Mei-Mei Gu et al.

Summary: This paper examines the strong Menger (edge) connectedness properties of graphs, exploring the topological features of the augmented k-ary n-cube. The results show that under certain conditions, specific graphs exhibit optimal connectivity, tolerating the maximum number of faults.

COMPUTER JOURNAL (2021)

Add to Collection

Article Mathematics

Some Results About the Reliability of Folded Hypercubes

Mohsen Ghasemi

Summary: This paper investigates reliability measures such as super-connectivity and cyclic edge connectivity in folded hypercubes.

BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY (2021)

Add to Collection

Article Mathematics, Applied

Reliability measure of multiprocessor system based on enhanced hypercubes

Liqiong Xu et al.

Summary: This paper discusses the reliability measure of multiprocessor systems based on edge connectivity, examining the impacts of extra edge connectivity and component edge connectivity on the robustness of multiprocessor systems. It also explores various types of connectivity in enhanced hypercubes and folded hypercubes, providing a detailed analysis and extension of previous results.

DISCRETE APPLIED MATHEMATICS (2021)

Add to Collection

Article Computer Science, Theory & Methods

Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube

Yihong Wang et al.

Summary: This research demonstrates the existence of multiple system design options with strong Menger connectivity in large-scale multiprocessor systems using interconnection networks as underlying topologies in the era of big data.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2021)

Add to Collection

Article Computer Science, Theory & Methods

Optimal node-disjoint paths in folded hypercubes

Cheng-Nan Lai

Summary: The study in this paper focuses on constructing m node-disjoint paths in a folded hypercube to minimize the total length and maximal length, where m <= n+1. By utilizing two specific routing functions, the construction of these paths can be efficiently carried out for odd and even routing, providing strong evidence for the effective applications of routing functions in deriving node-disjoint paths.

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2021)

Add to Collection

Article Mathematics, Applied

Edge-disjoint paths in faulty augmented cubes

Meijie Ma et al.

Summary: This article investigates edge-disjoint paths in augmented cubes with faulty edges, proving some important results and introducing the concept of extra edge-connectivity.

DISCRETE APPLIED MATHEMATICS (2021)

Add to Collection

Article Mathematics, Applied

Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs

Jia Guo et al.

Summary: The paper discusses the impact of connectivity and edge connectivity of interconnection networks on fault tolerance. Through mathematical models and definitions, the concepts of strong Menger edge connectivity and m-edge fault tolerance are explored, with BSn serving as a specific example for analysis and verification.

DISCRETE APPLIED MATHEMATICS (2021)

Add to Collection

Article Computer Science, Theory & Methods

Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes

Litao Guo et al.

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2020)

Add to Collection

Article Mathematics, Applied

R3-connectivity of folded hypercubes

Chia-Wei Lee et al.

DISCRETE APPLIED MATHEMATICS (2020)

Add to Collection

Article Computer Science, Theory & Methods

Edge-fault-tolerant strong Menger edge connectivity on regular graphs

Min Xu et al.

THEORETICAL COMPUTER SCIENCE (2020)

Add to Collection

Article Computer Science, Theory & Methods

The extra connectivity of the enhanced hypercubes

Eminjan Sabir et al.

THEORETICAL COMPUTER SCIENCE (2019)

Add to Collection

Article Mathematics, Applied

Conditional connectivity of folded hypercubes

Shuli Zhao et al.

DISCRETE APPLIED MATHEMATICS (2019)

Add to Collection

Article Computer Science, Theory & Methods

Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes

Qi Cheng et al.

THEORETICAL COMPUTER SCIENCE (2018)

Add to Collection

Article Computer Science, Theory & Methods

The vulnerability of the diameter of the enhanced hypercubes

Meijie Ma et al.

THEORETICAL COMPUTER SCIENCE (2017)

Add to Collection

Article Computer Science, Theory & Methods

Structure connectivity and substructure connectivity of hypercubes

Cheng-Kuan Lin et al.

THEORETICAL COMPUTER SCIENCE (2016)

Add to Collection

Article Computer Science, Information Systems

Maximally local connectivity and connected components of augmented cubes

Y-Chuang Chen et al.

INFORMATION SCIENCES (2014)

Add to Collection

Article Mathematics, Applied

On strong Menger-connectivity of star graphs

E Oh et al.

DISCRETE APPLIED MATHEMATICS (2003)

Add to Collection

Article Computer Science, Hardware & Architecture

Networks on chips: A new SoC paradigm

L Benini et al.

COMPUTER (2002)

Add to Collection

© Peeref 2019-2024. All rights reserved.