triangle graph
Смотреть что такое "triangle graph" в других словарях:
triangle — [ trijɑ̃gl ] n. m. • v. 1270; lat. triangulum 1 ♦ Figure géométrique, polygone plan à trois côtés. Les trois côtés, les trois sommets, les trois angles d un triangle. Triangle quelconque, scalène, isocèle, équilatéral. Triangle rectangle, qui a… … Encyclopédie Universelle
Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
triangle de couleurs — ● loc. m. ►GRAPH►INTGRAF widget permettant de choisir une couleur. Variante de la roue de couleurs (à moins que ce soit l inverse). Le triangle de Gimp … Dictionnaire d'informatique francophone
Schwarz triangle — In geometry, a Schwarz triangle, named after Hermann Schwarz is a spherical triangle that can be used to tile a sphere, possibly overlapping, through reflections in its edges. They were classified in (Schwarz 1873). These can be defined more… … Wikipedia
Graphe triangle — Représentation du graphe triangle. Notation C3, K3 Nombre de sommets 3 Nombre d arêtes 3 Distribution des degrés 2 ré … Wikipédia en Français
Colin de Verdière graph invariant — Colin de Verdière s invariant is a graph parameter μ(G) for any graph G introduced by Yves Colin de Verdière in 1990. It was motivated by the study of the maximum multiplicity of the second eigenvalue of certain Schrödinger operators.[1] Contents … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Grötzsch graph — infobox graph name = Grötzsch graph namesake = Herbert Grötzsch vertices = 11 edges = 20 chromatic number = 4 chromatic index = girth = 4 properties = The Grötzsch graph is a triangle free graph with 11 vertices, 20 edges, and chromatic number 4 … Wikipedia
