single graph
Смотреть что такое "single graph" в других словарях:
Graph pebbling — is a mathematical game and area of interest played on a graph with pebbles on the vertices. Game play is composed of a series of pebbling moves. A pebbling move on a graph consists of taking two pebbles off one vertex and placing one on an… … Wikipedia
Single-subject research — is the extreme case of small n research. It is often used in situations where only quasi experimental research designs are applicable. This group of research methods is used extensively in the experimental analysis of behavior and applied… … Wikipedia
Single subject design — or Single Case Research Design is a research design most often used in applied fields of psychology, education, and human behavior in which the subject serves as his/her own control, rather than utilizing another individual/group. Researchers… … Wikipedia
Single-subject design — or single case research design is a research design most often used in applied fields of psychology, education, and human behavior in which the subject serves as his/her own control, rather than using another individual/group. Researchers use… … Wikipedia
Graph rewriting — In graph theory, graph rewriting is a system of rewriting for graphs, i.e. a set of graph rewrite rules of the form p: L ightarrow R, with L being called pattern graph (or left hand side) and R being called replacement graph (or right hand side… … Wikipedia
Graph of groups — In geometric group theory, a graph of groups is an object consisting of a collection of groups indexed by the vertices and edges of a graph, together with a family of injective homomorphisms of the edge groups into the vertex groups.There is a… … 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
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … 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 factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
graph — I. noun Etymology: short for graphic formula Date: 1886 1. the collection of all points whose coordinates satisfy a given relation (as a function) 2. a diagram (as a series of one or more points, lines, line segments, curves, or areas) that… … New Collegiate Dictionary
