nonadjacent set
Смотреть что такое "nonadjacent set" в других словарях:
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
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
Rook's graph — infobox graph name = Rook s graph image caption = 8x8 Rook s graph vertices = nm edges = nm ( n + m )/2 nm diameter = 2 chromatic number = max( n , m ) chromatic index = girth = 3 (if max( n , m ) ≥ 3) properties = regular, vertex transitive,… … Wikipedia
Two-graph — In mathematics, a two graph is a set of (unordered) triples chosen from a finite vertex set X , such that every (unordered) quadruple from X contains an even number of triples of the two graph. A regular two graph has the property that every pair … Wikipedia
Induced path — An induced path of length four in a cube. Finding the longest induced path in a hypercube is known as the snake in the box problem. In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced… … Wikipedia
Ottawa dialect — Ottawa Nishnaabemwin, Daawaamwin Spoken in Canada, United States Region Ontario, Michigan, Oklahoma Ethnicity Ottawa people … Wikipedia
Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… … Wikipedia
Ojibwe language — Anishinaabemowin, ᐊᓂᔑᓈᐯᒧᐎᓐ Pronunciation [anɪʃɪnaːpeːmowɪn] Spoken in … Wikipedia
Root system — This article discusses root systems in mathematics. For root systems of plants, see root. Lie groups … 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
chess — chess1 /ches/, n. a game played by two persons, each with 16 pieces, on a chessboard. [1150 1200; ME < OF esches, pl. of eschec CHECK1] chess2 /ches/, n., pl. chess, chesses. one of the planks forming the roadway of a floating bridge. [1425 75;… … Universalium
