Characterization of minimum restricted arc-cuts of unidirectional hypercubes

DOI10.1016/J.TCS.2025.115717MaRDI QIDQ6875305zbMATH OpenFDO

Authors Xiaohui Hua, Rui Ma

Publication date 14 January 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115717

zbMATH Keywords

minimum restricted arc-cutrestricted arc-connectivityunidirectional hypercube

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• \(\lambda ^{\prime}\)-optimal digraphs
• A characterization of the edge connectivity of direct products of graphs
• Arc fault tolerance of Cartesian product digraphs on hyper arc connectivity
• Characterizations of optimal component cuts of locally twisted cubes
• Component connectivity of the hypercubes
• Digraphs. Theory, algorithms and applications
• scientific article; zbMATH DE number 1769329 (Why is no real title available?)
• On container length and wide-diameter in undirectional hypercubes
• On Hamiltonian properties of unidirectional hypercubes
• On the super-restricted arc-connectivity of s-geodetic digraphs
• Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes
• Restricted arc-connectivity of digraphs
• Super restricted edge connectivity of regular edge-transitive graphs
• Synthesis of reliable networks - a survey
• The super restricted edge-connectedness of direct product graphs

This page was built for publication: Characterization of minimum restricted arc-cuts of unidirectional hypercubes

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