# zbMATH — the first resource for mathematics

Sufficient conditions for maximally arc-connected digraphs depending on the clique number. (Chinese. English summary) Zbl 07267378
Summary: Interconnection networks are often modeled by digraphs. The arc-connectivity $$\lambda (D)$$ of a digraph $$D$$ is an important measurement for fault tolerance of networks. Let $$\delta (D)$$ be the minimum degree of $$D$$. Then $$\lambda (D) \le \delta (D)$$. A digraph is called maximally arc-connected if $$\lambda (D) = \delta (D)$$. In this paper, we present sufficient conditions for maximally arc-connected digraphs depending on the clique number.
##### MSC:
 05C20 Directed graphs (digraphs), tournaments 05C40 Connectivity