Search Results for ""

Move a point Pi_0 along a line from an initial point to a final point. It traces out a line segment Pi_1. When Pi_1 is translated from an initial position to a final ...

At the points where a line X cuts the sides of a triangle DeltaA_1A_2A_3, draw three perpendiculars to the sides, one through each point of intersection. The resulting three ...

Given n points, find the line segments with the shortest possible total length which connect the points. The segments need not necessarily be straight from one point to ...

A collection of subsets of a topological space that is contained in a basis of the topology and can be completed to a basis when adding all finite intersections of the ...

A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...

The Descartes snarks are a set of snarks on 210 vertices and 315 edges discovered by William Tutte in 1948 writing under the pseudonym Blanche Descartes (Descartes 1948; ...

A graph G is fully reconstructible in C^d if the graph is determined from its d-dimensional measurement variety. If G is globally rigid in R^d on n>=d+2 vertices, then G is ...

The scramble number sn(G) of a graph G is a graph invariant developed to aid in the study of gonality of graphs. The scramble number is NP-hard to compute (Echavarria et al. ...

An interval is a connected portion of the real line. If the endpoints a and b are finite and are included, the interval is called closed and is denoted [a,b]. If the ...

While the Catalan numbers are the number of p-good paths from (n,n) to (0,0) which do not cross the diagonal line, the super Catalan numbers count the number of lattice paths ...