Search Results for ""

The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...

Starting with the circle P_1 tangent to the three semicircles forming the arbelos, construct a chain of tangent circles P_i, all tangent to one of the two small interior ...

The Perkel graph is a weakly regular graph on 57 vertices and 171 edges, shown above in several embeddings. It is the unique distance-regular graph with intersection array ...

A plane partition is a two-dimensional array of integers n_(i,j) that are nonincreasing both from left to right and top to bottom and that add up to a given number n. In ...

A Ruth-Aaron pair is a pair of consecutive numbers (n,n+1) such that the sums of the prime factors of n and n+1 are equal. They are so named because they were inspired by the ...

As originally stated by Gould (1972), GCD{(n-1; k),(n; k-1),(n+1; k+1)} =GCD{(n-1; k-1),(n; k+1),(n+1; k)}, (1) where GCD is the greatest common divisor and (n; k) is a ...

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 ...

The Thue-Morse constant, also called the parity constant, is given by the concatenated digits of the Thue-Morse sequence P=0.0110100110010110100101100..._2 (1) (OEIS A010060) ...

The torus grid graph T_(m,n) is the graph formed from the graph Cartesian product C_m square C_n of the cycle graphs C_m and C_n. C_m square C_n is isomorphic to C_n square ...

A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...