Search Results for ""

The horizontal line segment in the above figure appears to be shorter than the vertical line segment, despite the fact that it has the same length.

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.

Let G(V,E) be a graph with graph vertices V and graph edges E on n graph vertices without a (k+1)-clique. Then t(n,k)<=((k-1)n^2)/(2k), where t(n,k) is the edge count. (Note ...

Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...

A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...

The locus of the point at which two given circles possess the same circle power is a straight line perpendicular to the line joining the midpoints of the circle and is known ...

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...