Search Results for ""

A transcendental number is a (possibly complex) number that is not the root of any integer polynomial, meaning that it is not an algebraic number of any degree. Every real ...

The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

In two dimensions, there are two periodic circle packings for identical circles: square lattice and hexagonal lattice. In 1940, Fejes Tóth proved that the hexagonal lattice ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The molecular topological index is a graph index defined by MTI=sum_(i=1)^nE_i, where E_i are the components of the vector E=(A+D)d, with A the adjacency matrix, D the graph ...

The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...

Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...