Search Results for ""

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...

The triangle function is the function Lambda(x) = {0 |x|>=1; 1-|x| |x|<1 (1) = Pi(x)*Pi(x) (2) = Pi(x)*H(x+1/2)-Pi(x)*H(x-1/2), (3) where Pi(x) is the rectangle function, ...

Let x and y be vectors. Then the triangle inequality is given by |x|-|y|<=|x+y|<=|x|+|y|. (1) Equivalently, for complex numbers z_1 and z_2, ...

The truncated square pyramid is a special case of a pyramidal frustum for a square pyramid. Let the base and top side lengths of the truncated pyramid be a and b, and let the ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

Willans' formula is a prime-generating formula due to Willan (1964) that is defined as follows. Let F(j) = |_cos^2[pi((j-1)!+1)/j]_| (1) = {1 for j=1 or j prime; 0 otherwise ...

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

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

In general, an icosidodecahedron is a 32-faced polyhedron. A number of such solids are illustrated above. "The" (quasiregular) icosidodecahedron is the 32-faced Archimedean ...