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, ...
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 ...
Advances in Applied Probability, Vol. 24, No. 4 (Dec., 1992), pp. 845-857 (13 pages) A three-parameter model of a random directed graph (digraph) is specified by the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback