Let D be a graph or a digraph. If δ (D) is the minimum degree, λ (D) the edge-connectivity
and κ (D) the vertex-connectivity, then κ (D)⩽ λ (D)⩽ δ (D) is a well-known basic relationship …

We examine the p-ary codes, for any prime p, from the row span over F _p of| V|×| E|
incidence matrices of connected graphs Γ=(V, E), showing that certain properties of the …

For a connected graph G=(V, E), an edge set S⊆ E is a k-restricted edge cut if G− S is
disconnected and every component of G− S has at least k vertices. The k-restricted edge …

Since interconnection networks are often modeled by graphs or digraphs, the edge-
connectivity of a graph or arc-connectivity of a digraph are important measurements for fault …

For a strongly connected digraph D=(V (D), A (D)), an arc set S⊆ A (D) is a k-restricted arc
cut if D− S has a non-trivial strongly connected component D1 such that D− V (D1) contains …

Restricted arc-connectivity is a more refined network reliability index than arc-connectivity. In
this paper, we first introduce the concept of minimum arc-degree and show for many …

An edge‐cut S of a connected graph G is called a restricted edge‐cut if G‐S contains no
isolated vertices. The minimum cardinality of all restricted edge‐cuts is called the restricted …

For a connected graph G=(V, E), an edge set S⊂ E is a k-restricted edge cut if G− S is
disconnected and every component of G− S contains at least k vertices. The k-restricted …

For a strongly connected digraph D the restricted arc‐connectivity λ′(D) is defined as the
minimum cardinality of an arc‐cut over all arc‐cuts S satisfying that D‐S has a non‐trivial …

The restricted connectivity κ′(G) of a connected graph G is defined as the minimum
cardinality of a vertex-cut over all vertex-cuts X such that no vertex u has all its neighbors in …