Search Results for ""

An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge ...

A maze, also known as a labyrinth, as is a set of passages (with impermeable walls). The goal of the maze is to start at one given point and find a path through the passages ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

The modified bessel function of the second kind is the function K_n(x) which is one of the solutions to the modified Bessel differential equation. The modified Bessel ...

The necker cube is an illusion in which a two-dimensional drawing of an array of cubes appears to simultaneously protrude from and intrude into the page. A Necker cube ...

The 2-cusped epicycloid is called a nephroid. The name nephroid means "kidney shaped" and was first used for the two-cusped epicycloid by Proctor in 1878 (MacTutor Archive). ...

The Neuberg A_1-circle is the locus of the polygon vertex A_1 of a triangle on a given base A_2A_3 and with a given Brocard angle omega. From the center N_1, the base A_2A_3 ...

There are a number of attractive polyhedron compounds consisting of five octahedra. The first octahedron 5-compound is a polyhedron compound composed of five octahedra ...

A parallelian is a line drawn parallel to one side of a triangle. The three lines drawn through a given point are known as the triangle's parallelians. There exists a unique ...

The Penrose triangle, also called the tribar (Cerf), tri-bar (Ernst 1987), impossible tribar (Pappas 1989, p. 13), or impossible triangle, is an impossible figure published ...