Branch (graph theory)

Branch (graph theory)

In mathematics, especially mathematical logic and set theory, a branch of a tree "T" is a map "f" such that ∀"n" : "f" ("n") ∈ "T".

By a tree on a product set κ1 ×···× κ"p" we mean here a subset of the union of κ1"i"×···×κ"p""i" for all i < ω,: Tsubseteqigcup_{i
closed under initial segments,and the set of branches of such a tree is then more explicitly the set: [T] ={ (f_1,...,f_p)midforall ninomega: (f_1(n),...,f_p(n))in T} ~.

This is a closed set for the usual product topology (see AD plus).

ee also

*AD plus and references therein.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

  • graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… …   Universalium

  • graph theory — A branch of mathematics used to represent relations and networks. A graph consists of a set of points (nodes or vertices) and the pairwise links between them (arcs or lines). In sociological applications, the nodes are typically individuals,… …   Dictionary of sociology

  • Algebraic graph theory — is a branch of mathematics in which algebraic methods are applied to problems about graphs. In one sense, algebraic graph theory studies graphs in connection with linear algebra. Especially, it studies the spectrum of the adjacency matrix, the… …   Wikipedia

  • Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… …   Wikipedia

  • Extremal graph theory — is a branch of mathematics. In the narrow sense, extremal graph theory studies the graphs which are extremal among graphs with a certain property. There are various meanings for the word extremal : with the largest number of edges, the largest… …   Wikipedia

  • Chemical graph theory — is the topology branch of mathematical chemistry which applies graph theory to mathematical modelling of chemical phenomena.[1] The pioneers of the chemical graph theory are Alexandru Balaban, Ivan Gutman, Haruo Hosoya, Milan Randić and Nenad… …   Wikipedia

  • Topological graph theory — In mathematics topological graph theory is a branch of graph theory. It studies the embedding of graphs in surfaces, and graphs as topological spaces. [J.L. Gross and T.W. Tucker, Topological graph theory, Wiley Interscience, 1987] Embedding a… …   Wikipedia

  • Rank (graph theory) — In graph theory, a branch of mathematics, the rank of an undirected graph is defined as the number n − c, where n is the number of vertices and c is the number of connected components of the graph. Equivalently, the rank of a graph is the rank of …   Wikipedia

  • graph theory — noun Date: 1947 a branch of mathematics concerned with the study of graphs …   New Collegiate Dictionary

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”