Search Results for ""

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

A vertex is a special point of a mathematical object, and is usually a location where two or more lines or edges meet. Vertices are most commonly encountered in angles, ...

The point about which an angle is measured is called the angle's vertex, and the angle theta associated with a given vertex is called the vertex angle. In a polygon, the ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

The contraction of a pair of vertices v_i and v_j of a graph, also called vertex identification, is the operation that produces a graph in which the two nodes v_1 and v_2 are ...

The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted tau(G). The König-Egeváry theorem states that the ...

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...