Search Results for ""

The Frucht graph is smallest cubic identity graph (Skiena 1990, p. 185). It is implemented in the Wolfram Language as GraphData["FruchtGraph"]. It has 12 vertices and 18 ...

The Fuhrmann triangle of a reference triangle DeltaABC is the triangle DeltaF_CF_BF_A formed by reflecting the mid-arc points arcM_A, arcM_B, arcM_C about the lines AB, AC, ...

Given a function f(x_1,...,x_n) defined on a domain U, the graph of f is defined as the set of points (which often form a curve or surface) showing the values taken by f over ...

The Gauss-Bonnet formula has several formulations. The simplest one expresses the total Gaussian curvature of an embedded triangle in terms of the total geodesic curvature of ...

The Gauss-Seidel method (called Seidel's method by Jeffreys and Jeffreys 1988, p. 305) is a technique for solving the n equations of the linear system of equations Ax=b one ...

Gaussian curvature, sometimes also called total curvature (Kreyszig 1991, p. 131), is an intrinsic property of a space independent of the coordinate system used to describe ...

Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...

The Gegenbauer polynomials C_n^((lambda))(x) are solutions to the Gegenbauer differential equation for integer n. They are generalizations of the associated Legendre ...

A generalized dodecagon is a generalized polygon of order 12. GD(1,2) is the (3,12)-cage graph, more commonly known as the Tutte 12-cage. GD(2,1) is the line graph of the ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...