n-valent vertex
Смотреть что такое "n-valent vertex" в других словарях:
Knot theory — A three dimensional depiction of a thickened trefoil knot, the simplest non trivial knot … Wikipedia
Meredith graph — The Meredith graph Named after G. H. Meredith Vertices 70 Edges 140 … Wikipedia
Acyclic coloring — In graph theory, an acyclic coloring is a (proper) vertex coloring in which every 2 chromatic subgraph is acyclic.The acyclic chromatic number A( G ) of a graph G is the least number of colors needed in any acyclic coloring of G .Some properties… … Wikipedia
Virtual knot — In knot theory, a virtual knot is a generalization of the classical idea of knots in several ways which are all equivalent.*In the theory of classical knots, knots can be considered equivalence classes of knot diagrams under the Reidemeister… … Wikipedia
Tiger Graph — Definition: A Tiger Graph is a is a finite, 4 valent, directed, edge 2 colored graph where each vertex has one in edge and one out edge of each color.Remark: Because of the above restrictions placed on the tiger graphs, for any given tiger graph … Wikipedia
WebGL — Développeur WebGL Working Group Environnements Web Cross platform … Wikipédia en Français
QUANTIQUE (MÉCANIQUE) - Propriétés fondamentales — La mécanique quantique est aujourd’hui une théorie parfaitement «classique», dont la cohérence n’a fait que se renforcer au cours des cinquante dernières années. Après un laborieux enfantement au début du XXe siècle, elle accède à la maturité… … Encyclopédie Universelle
