News
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, ...
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 ...
Adam Hayes, Ph.D., CFA, is a financial writer with 15+ years Wall Street experience as a derivatives trader. Besides his extensive derivative trading expertise, Adam is an expert in economics and ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback