Uniform tree

Uniform tree

In mathematics, a uniform tree is a locally finite tree which is the universal cover of a finite graph. Equivalently, the full automorphism group G=Aut(X) of the tree, which is a locally compact topological group, is unimodular and GX is finite. Also equivalent is the existence of a uniform X-lattice in G.

Sources

*


Wikimedia Foundation. 2010.

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

Look at other dictionaries:

  • Uniform-cost search — In computer science, uniform cost search (UCS) is a tree search algorithm used for traversing or searching a weighted tree, tree structure, or graph. Intuitively, the search begins at the root node. The search continues by visiting the next node… …   Wikipedia

  • Uniform Resource Name — The relationship of URN to URI and URL A Uniform Resource Name (URN) is a Uniform Resource Identifier (URI) that uses the urn scheme and does not imply availability of the identified resource. Both URNs (names) and URLs (locators) are URIs, and a …   Wikipedia

  • Uniform and insignia of the Boy Scouts of America — The uniform and insignia of the Boy Scouts of America (BSA) gives a Scout visibility and creates a level of identity within both the unit and the community. The uniform is used to promote equality while showing individual achievement. While all… …   Wikipedia

  • Tree — For other uses, see Tree (disambiguation). Trees on a mountain in northern Utah during early autumn …   Wikipedia

  • Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …   Wikipedia

  • Tree model — Austro Asiatic Language Tree Maya Lan …   Wikipedia

  • World War II German uniform — This article discusses the uniforms of the World War II Wehrmacht (Army, Air Force, and Navy). For the Waffen SS, see Uniforms and insignia of the Schutzstaffel. German general Alfred Jodl wearing black leather trenchcoat …   Wikipedia

  • Splay tree — A splay tree is a self balancing binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look up and removal in O(log(n)) amortized time. For many… …   Wikipedia

  • Spanning tree (mathematics) — In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G . Informally, a spanning tree of G is a selection of edges of G… …   Wikipedia

  • Military uniform — This article is about standardised military dress. For military protective clothing, see Armour. French, Belgian, Portuguese, Indonesian and Indian military personnel in uniform during a parade in Rome, Italy Military uniforms comprises… …   Wikipedia

Share the article and excerpts

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