Search Results for ""

A ruled surface is a surface that can be swept out by moving a line in space. It therefore has a parameterization of the form x(u,v)=b(u)+vdelta(u), (1) where b is called the ...

A secant line, also simply called a secant, is a line passing through two points of a curve. As the two points are brought together (or, more precisely, as one is brought ...

The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...

An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007). Firecracker graphs are graceful ...

A fusene is a simple planar 2-connected graph embedded in the plane with all vertices of degree 2 or 3, all bounded faces (not necessarily regular) hexagons, and all vertices ...

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...

Discrete Mathematics

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...