Search Results for ""

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...

Wavelets are a class of a functions used to localize a given function in both space and scaling. A family of wavelets can be constructed from a function psi(x), sometimes ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...

A general quadratic Diophantine equation in two variables x and y is given by ax^2+cy^2=k, (1) where a, c, and k are specified (positive or negative) integers and x and y are ...

Fermat's last theorem is a theorem first proposed by Fermat in the form of a note scribbled in the margin of his copy of the ancient Greek text Arithmetica by Diophantus. The ...

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 Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...