dominating

  • 1dominating — adj. 1. exercising influence or control. Opposite of {subordinate}. Syn: ascendant, ascendent, prestigious, dominant. [WordNet 1.5] 2. high enough to provide a clear view of the surrounding area; of a height or viewpoint. Syn: commanding,… …

    The Collaborative International Dictionary of English

  • 2dominating — index leading (ranking first), omnipotent, powerful, predominant, prevailing (having superior force), salient Burton s Legal Thesaurus. William C. Burton …

    Law dictionary

  • 3dominating — adjective 1. most powerful or important or influential (Freq. 1) the economically ascendant class D day is considered the dominating event of the war in Europe • Syn: ↑ascendant, ↑ascendent • Similar to: ↑dominant …

    Useful english dictionary

  • 4dominating — [[t]dɒ̱mɪneɪtɪŋ[/t]] ADJ GRADED: usu ADJ n A dominating person has a very strong personality and influences the people around them. She certainly was a dominating figure, a leader who gave her name to a political philosophy... The boy was brought …

    English dictionary

  • 5Dominating — Dominate Dom i*nate, v. t. [imp. & p. p. {Dominated}; p. pr. & vb. n. {Dominating}.] [L. dominatus, p. p. of dominari to dominate, fr. dominus master, lord. See {Dame}, and cf. {Domineer}.] To predominate over; to rule; to govern. A city… …

    The Collaborative International Dictionary of English

  • 6dominating — adj. Dominating is used with these nouns: ↑presence …

    Collocations dictionary

  • 7dominating — (Roget s Thesaurus II) adjective Exercising controlling power or influence: commanding, controlling, dominant, domina tive, governing, paramount, preponderant, regnant, reigning, ruling. See OVER …

    English dictionary for students

  • 8dominating — domi·nate || dÉ‘mɪneɪt / dÉ’m v. control, rule, command …

    English contemporary dictionary

  • 9dominating action — index obsession Burton s Legal Thesaurus. William C. Burton. 2006 …

    Law dictionary

  • 10Dominating set — For Dominator in control flow graphs, see Dominator (graph theory). Dominating sets (red vertices). In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at… …

    Wikipedia

  • 11Dominating set problem — The dominating set problem is an NP complete problem in graph theory.DefinitionAn instance of the dominating set problem consists of: * a graph G with a set V of vertices and a set E of edges, and * a positive integer K smaller than or equal to… …

    Wikipedia

  • 12Dominating decision rule — In decision theory, a decision rule is said to dominate another if the performance of the former is sometimes better, and never worse, than that of the latter. Formally, let δ1 and δ2 be two decision rules, and let R(θ,δ) be the risk of rule δ… …

    Wikipedia

  • 13dominating set — noun A set of vertices of a graph, such that each vertex in that graph is either in that set or adjacent to some vertex in that set. See Also: domination number …

    Wiktionary

  • 14Edge dominating set — Examples of edge dominating sets. In graph theory, an edge dominating set for a graph G = (V, E) is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D. An edge dominating set is also known… …

    Wikipedia

  • 15Connected dominating set — In graph theory, a connected dominated set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph. Contents 1 Definitions 2 Complementarity 3 Algorithms 4 Applic …

    Wikipedia

  • 16Claw-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

  • 17Domatic number — A domatic partition. In graph theory, a domatic partition of a graph G = (V,E) is a partition of V into disjoint sets V1, V2,...,VK such that each Vi is a dominati …

    Wikipedia

  • 18Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… …

    Wikipedia

  • 19WAR OF INDEPENDENCE — (Heb. מִלְחֶמֶת הָעַצְמָאוּת Milḥemet ha Aẓma ut, or מִלְחֶמֶת הַקּוֹמְמִיּוֹּת Milḥemet ha Komemiyyut, or מִלְחֶמֶת הַשִּׁחְרוּר Milḥemet ha Shiḥrur (the War of Liberation), war waged by the Jews of Palestine for survival, freedom, and political …

    Encyclopedia of Judaism

  • 20Face Negotiation Theory — is a theory first postulated by Stella Ting Toomey in 1985 to explain how different cultures manage conflict and communicate. The theory has gone through multiple iterations since that time, and has been updated most recently in 2005.1 In essence …

    Wikipedia