Strong Menger Connectivity of Alternating Group Network Under Subnetwork Failure

The construction of vertex (edge) disjoint paths have been well applied to the study of connectivity, diameter, parallel routing, reliability and fault tolerance of an interconnection network. The Menger-type problem about vertex (edge) disjoint paths in interconnection network has received extensive attention. A connected graph is strong Menger vertex (edge) connected if there exist [Formula: see text] vertex (edge) disjoint paths between any two distinct vertices [Formula: see text] and [Formula: see text] in graph [Formula: see text]. In this work, we determine the strong Menger connectivity of alternating group network ([Formula: see text]) when the genetic subnetwork fails. In detail, we show that [Formula: see text] is strong Menger vertex (edge) connected where [Formula: see text] is isomorphic to [Formula: see text] ([Formula: see text]).

Authors

Institutions

Publication Details

Journal
International Journal of Foundations of Computer Science
Published
2026-05-28
DOI
https://doi.org/10.1142/s0129054126500140
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Strong Menger Connectivity of Alternating Group Network Under Subnetwork Failure

Hong Bian, Hong Zhang
International Journal of Foundations of Computer Science
Interconnection Networks and Systems
article

Strong Menger Connectivity of Alternating Group Network Under Subnetwork Failure

Hong Bian, Hong Zhang
article en

Abstract

The construction of vertex (edge) disjoint paths have been well applied to the study of connectivity, diameter, parallel routing, reliability and fault tolerance of an interconnection network. The Menger-type problem about vertex (edge) disjoint paths in interconnection network has received extensive attention. A connected graph is strong Menger vertex (edge) connected if there exist [Formula: see text] vertex (edge) disjoint paths between any two distinct vertices [Formula: see text] and [Formula: see text] in graph [Formula: see text]. In this work, we determine the strong Menger connectivity of alternating group network ([Formula: see text]) when the genetic subnetwork fails. In detail, we show that [Formula: see text] is strong Menger vertex (edge) connected where [Formula: see text] is isomorphic to [Formula: see text] ([Formula: see text]).

International Journal of Foundations of Computer Science
Xinjiang Normal University (CN)
Openalex Percentile: Top 3%
Interconnection Networks and Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.