Search Results for ""

A cycle graph of a group is a graph which shows cycles of a group as well as the connectivity between the cycles. Such graphs are constructed by drawing labeled nodes, one ...

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

A graph cycle.

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

Graph Strength

In plane geometry, a chord is the line segment joining two points on a curve. The term is often used to describe a line segment whose ends lie on a circle. The term is also ...

A complex line bundle is a vector bundle pi:E->M whose fibers pi^(-1)(m) are a copy of C. pi is a holomorphic line bundle if it is a holomorphic map between complex manifolds ...

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

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

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...