- edge covering number
-
the number of edges in a minimum edge cover of a graph, often denoted as .See Also: covering number
Wikipedia foundation.
edge covering number
Look at other dictionaries:
covering number — noun The number of vertices in a minimum vertex cover of a graph, often denoted as . See Also: edge covering number … Wiktionary
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
Edge cover — In graph theory, an edge cover of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set. In computer science, the minimum edge cover problem is the problem of finding an edge cover of minimum… … Wikipedia
edge cover — noun A set of edges which touch all the vertices of a graph. See Also: edge covering number, vertex cover … Wiktionary
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
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
number game — Introduction any of various puzzles and games that involve aspects of mathematics. Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… … Universalium
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
Intersection number (graph theory) — In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover… … Wikipedia
List of animals of the Edge Chronicles — This article lists the vast array of fictional animals found in the Edge Chronicles, a series of young adult books set in a fantasy world created by Paul Stewart and Chris Riddell. For more information about the fictional world of the Edge,… … Wikipedia
