Search Results for ""
21 - 30 of 152 for networkSearch Results
View search results from all Wolfram sites (3768 matches)Discrete Mathematics
The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...
A local source is a node of a directed graph with no entering edges (Borowski and Borwein 1991, p. 401; left figure), and a global source (often simply called a source) is a ...
Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...
A circle with an arrow indicating a direction.
Not concentric.
The radius of the smallest circle centered at one of the points of an N-cluster, which contains all the points in the N-cluster.
The number of inward directed graph edges from a given graph vertex in a directed graph.
In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...
A local sink is a node of a directed graph with no exiting edges, also called a terminal (Borowski and Borwein 1991, p. 401; left figure). A global sink (often simply called ...
...