Search Results for ""

Let Y_n denote the graph with vertex set V(X_n), where X_n is the n-hypercube and two vertices are adjacent in Y_n iff they are at distance 1<=d<=2 in X_n. Y_n is not ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...

There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

The n-dimensional Keller graph, sometimes denoted G_n (e.g., Debroni et al. 2011), can be defined on a vertex set of 4^n elements (m_1,...,m_n) where each m_i is 0, 1, 2, or ...

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...

Consider the plane quartic curve X defined by x^3y+y^3z+z^3x=0, where homogeneous coordinates have been used here so that z can be considered a parameter (the plot above ...

The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...

LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...

Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...