Search Results for ""

The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...

The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

The assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.

The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...

The composition G=G_1[G_2] of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with point vertex V_1×V_2 and u=(u_1,u_2) ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

The cube of a graph is defined as its third graph power.

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...