Component edge connectivity of folded hypercube-like networks

DOI10.1016/J.DAM.2025.07.011MaRDI QIDQ6906755zbMATH OpenFDO

Authors Litao Guo, Xiangyan Kong

Publication date 4 November 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.07.011

zbMATH Keywords

componentfault tolerancefolded hypercube-like networksnetworks

Mathematics Subject Classification ID

Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network protocols (68M12) Graph theory (including graph drawing) in computer science (68R10)

Review text

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$.

Cites work

• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• Component connectivity of hypercubes
• Component connectivity of the hypercubes
• Conditional matching preclusion sets
• Connectivity and super connectivity of enhanced folded hypercube-like networks
• Connectivity and super connectivity of folded hypercube-like networks
• Graph theory with applications
• scientific article; zbMATH DE number 4023324 (Why is no real title available?)
• On \(g\)-extra connectivity of hypercube-like networks
• Reliability analysis of twisted cubes
• Reliability Evaluation of BC Networks

Cited in

(10)

• Neighbor connectivity of bubble-sort star graphs
• Fault tolerability of Cayley graphs generated by transposition unicyclic graphs with a triangle
• Hamiltonian cycle and path of folded hypercube with faulty matchings
• \(\{ 1, 2, 3 \}\)-extra connectivity of Cayley graphs generated by \(k\)-trees
• Fault tolerability analysis of hypercubes based on the g-cyclic fault pattern
• Characterization of 2-extra 2-component diagnosability of general graphs based on 2-good-neighbor connectivity
• Star and h-step-limited star connectivity of exchanged hypercubes
• The non-inclusive component diagnosability of hypercubes
• Fault tolerance evaluation of a new of recursive network
• The \(g\)-good-neighbor conditional diagnosability of generalized folded hypercubes under the PMC and \(\mathrm{MM}^\ast\) models

This page was built for publication: Component edge connectivity of folded hypercube-like networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906755)