covering

  • 31Covering power — Covering power. См. Мощность покрытия. (Источник: «Металлы и сплавы. Справочник.» Под редакцией Ю.П. Солнцева; НПО Профессионал , НПО Мир и семья ; Санкт Петербург, 2003 г.) …

    Словарь металлургических терминов

  • 32covering a wide area — index extensive Burton s Legal Thesaurus. William C. Burton. 2006 …

    Law dictionary

  • 33covering all cases — index broad Burton s Legal Thesaurus. William C. Burton. 2006 …

    Law dictionary

  • 34covering fire — index barrage Burton s Legal Thesaurus. William C. Burton. 2006 …

    Law dictionary

  • 35covering letter — (N. Amer. cover letter) ► NOUN ▪ a letter explaining the contents of an accompanying enclosure …

    English terms dictionary

  • 36Covering space — A covering map satisfies the local triviality condition. Intuitively, such maps locally project a stack of pancakes above an open region, U, onto U. In mathematics, more specifically algebraic topology, a covering map is a continuous surjective… …

    Wikipedia

  • 37Covering group — This article is about topological covering group. For algebraic covering group, see universal perfect central extension. In mathematics, a covering group of a topological group H is a covering space G of H such that G is a topological group and… …

    Wikipedia

  • 38Covering graph — In the mathematical discipline of graph theory, a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C to the vertex set of G. A covering map f is a surjection and a local isomorphism: the… …

    Wikipedia

  • 39Covering set — In mathematics, a covering set for a sequence of integers refers to a set of prime numbers such that every term in the sequence is divisible by at least one member of the set. The term covering set is used only in conjunction with sequences… …

    Wikipedia

  • 40Covering (graph theory) — In the mathematical discipline of graph theory, a covering (or cover) of a graph is a set of vertices (or edges) such that each edge (vertex) of the graph touches (is incident with) at least one element of the set.It is of mathematical interest… …

    Wikipedia