Search Results for ""

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

A cycle double cover of an undirected graph is a collection of cycles that cover each edge of the graph exactly twice. For a polyhedral graph, the faces of a corresponding ...