Search Results for ""

A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological ...

Let m_1, m_2, ..., m_n be distinct primitive elements of a two-dimensional lattice M such that det(m_i,m_(i+1))>0 for i=1, ..., n-1. Each collection Gamma={m_1,m_2,...,m_n} ...

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...

A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

Given a triangle center X=l:m:n, the line mnalpha+nlbeta+lmgamma=0, where alpha:beta:gamma are trilinear coordinates, is called the trilinear polar (Kimberling 1998, p. 38). ...

Let G be Gauss's constant and M=1/G be its multiplicative inverse. Then M/sqrt(2)=0.8472130... (OEIS A097057) is sometimes known as the ubiquitous constant (Spanier and ...

Consider expressions built up from variables and constants using function symbols. If v_1, ..., v_n are variables and t_1, ..., t_n are expressions, then a set of mappings ...

In an integral domain R, the decomposition of a nonzero noninvertible element a as a product of prime (or irreducible) factors a=p_1...p_n, (1) is unique if every other ...

The unsorted union of a list S is a list containing the same elements as S but with the second and subsequent occurrence of any given element removed. For example, the ...