Search Results for ""

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

A line segment where two faces of a polyhedron meet, also called a side.

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...