Search Results for ""

An odd chordless cycle is a chordless cycle of length >4. A graph is said to be perfect iff neither the graph G nor its graph complement G^_ has an odd chordless cycle. A ...

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

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 quantity which gives the inclination of a curve or line with respect to another curve or line. For a line in the xy-plane making an angle theta with the x-axis, the slope m ...

A correspondence between two line segment ranges that are sections of one pencil by two distinct lines.

Two sextuples of skew lines on the general cubic surface such that each line of one is skew to one line in the other set. In all, there are 30 points, with two lines through ...

The initial side of an angle theta drawn in angle standard position is the side lying on the positive x-axis. In general, viewing an angle as the amount of rotation about the ...

subjMathematics:Discrete Mathematics:Graph Theory:Cliques The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

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 ...