cubic graph
Смотреть что такое "cubic graph" в других словарях:
Cubic graph — Not to be confused with graphs of cubic functions. The Petersen graph is a Cubic graph … Wikipedia
Cubic — Cubical redirects here. For the partition, see cubicle. Contents 1 Science and mathematics 2 Computing 3 Media … 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
Cubic function — This article is about cubic equations in one variable. For cubic equations in two variables, see elliptic curve. Graph of a cubic function with 3 real roots (where the curve crosses the horizontal axis where y = 0). It has 2 critical points. Here … Wikipedia
Graph of a function — In mathematics, the graph of a function f is the collection of all ordered pairs ( x , f ( x )). In particular, if x is a real number, graph means the graphical representation of this collection, in the form of a curve on a Cartesian plane,… … Wikipedia
cubic environment mapping — ● ►en loc. m. ►GRAPH Technique de placage de textures sur des surfaces, disponible sous DirectX et OpenGL, dans laquelle les reflets de l environnement sur la surface sont calculés à partir d un cube entourant cette surface (si j ai bien compris… … Dictionnaire d'informatique francophone
Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 … Wikipedia
McGee graph — The McGee Graph Named after W. F. McGee Vertices 24 Edges … Wikipedia
Desargues graph — Named after Gérard Desargues Vertices 20 Edges 30 … Wikipedia
