Search Results for ""

The great rhombicosidodecahedral graph is the Archimedean graph on 120 vertices and 180 edges that is the skeleton of the great rhombicosidodecahedron as well as the uniform ...

The Hajós graph (Brandstädt et al. 1987, Berge 1989) is another name for the Sierpiński sieve graph S_2, which is isomorphic to the 2-sun graph. However, the term is also ...

The Hatzel graph is a planar hypohamiltonian graph on 57 vertices that was the smallest known example of such a graph until the discovery of the Zamfirescu graph on 48 ...

The house graph is a simple graph on 5 nodes and 6 edges, illustrated above in two embeddings, whose name derives from its resemblance to a schematic illustration of a house ...

An International Standard Book Number (ISBN) is a code used to uniquely identify a book together. It also uniquely encodes the book's publisher and includes information about ...

An idoneal number, also called a suitable number or convenient number, is a positive integer D for which the fact that a number is a monomorph (i.e., is expressible in only ...

An injective module is the dual notion to the projective module. A module M over a unit ring R is called injective iff whenever M is contained as a submodule in a module N, ...

The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...

The Kampé de Fériet function is a special function that generalizes the generalized hypergeometric function to two variables and includes the Appell hypergeometric function ...

In a boarding school there are fifteen schoolgirls who always take their daily walks in rows of threes. How can it be arranged so that each schoolgirl walks in the same row ...