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, ...

New research shows that metasurfaces could be used as strong linear quantum optical networks This approach could eliminate the need for waveguides and other conventional optical components Graph ...