Component edge connectivity of folded hypercube-like networks (Q6906755)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 8115075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Component edge connectivity of folded hypercube-like networks |
scientific article; zbMATH DE number 8115075 |
Statements
Component edge connectivity of folded hypercube-like networks (English)
0 references
4 November 2025
0 references
In a simple, finite, and undirected graph $G$, let $W$ be an edge subset of $G$. If the number of components of $(G-W)$ is at least $t$, then $W$ is a $t$-component edge cut of $G$. The number of edges in the least $t$-component edge cut is the $t$-component edge connectivity of $G$. The paper studies the folded hypercube-like networks and obtain its $t$-component edge connectivity of folded hypercube-like networks for some $t$.
0 references
networks
0 references
component
0 references
fault tolerance
0 references
folded hypercube-like networks
0 references
