Search Results for ""
41 - 50 of 201 for Apollonian networkSearch Results
View search results from all Wolfram sites (3834 matches)A box can be packed with a harmonic brick a×ab×abc iff the box has dimensions ap×abq×abcr for some natural numbers p, q, r (i.e., the box is a multiple of the brick).
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 ...
The number of inward directed graph edges from a given graph vertex in a directed graph.
A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.
The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].
Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.
The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).
A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...
A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...
...