Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

Quarterly of Applied Mathematics, Vol. 72, No. 4 (December 2014), pp. 731-745 (15 pages) An analytical approach is proposed to study the contribution of edge effects in the multiple high-frequency ...