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, ...
This is a preview. Log in through your library . Abstract We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process ...
New York, Nov. 12, 2021 (GLOBE NEWSWIRE) -- Reportlinker.com announces the release of the report "Graph Database Market Research Report by Type, by Components, by Application, by Deployment, by ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results