covering graph
Смотреть что такое "covering graph" в других словарях:
Covering 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
Covering (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
Covering — may refer to: Mathematics In topology: Covering map, a function from one space to another with uniform local neighborhoods Cover (topology), a system of (usually, open or closed) sets whose union is a given topological space Lebesgue covering… … Wikipedia
Covering 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
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Graph property — In graph theory a graph property is any inherently graph theoretical property of graphs (formal definitions follow), distinguished from properties of graphs described in terms of various graph representations: graph drawings, data structures for… … 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 factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
Covering problem — In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure covers another, or how large the structure has to be to do that. Covering problems are minimization problems… … Wikipedia
Covering relation — For other uses of Cover in mathematics, see Cover (mathematics). The Hasse diagram of the power set of three elements, partially ordered by inclusion. In mathematics, especially order theory, the covering relation of a partially ordered set is… … Wikipedia
covering number — noun The number of vertices in a minimum vertex cover of a graph, often denoted as . See Also: edge covering number … Wiktionary
