SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES
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, ...
Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback