Search Results for ""

The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...

In a rectangular room (a cuboid) with dimensions 30^'×12^'×12^', a spider is located in the middle of one 12^'×12^' wall one foot away from the ceiling. A fly is in the ...

The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...

Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) with the edges of the outer cycle removed. Web graphs are graceful. Precomputed ...

An interspersion array given by 1 2 3 5 8 13 21 34 55 ...; 4 6 10 16 26 42 68 110 178 ...; 7 11 18 29 47 76 123 199 322 ...; 9 15 24 39 63 102 165 267 432 ...; 12 19 31 50 81 ...

cos(pi/(15)) = 1/8(sqrt(30+6sqrt(5))+sqrt(5)-1) (1) cos((2pi)/(15)) = 1/8(sqrt(30-6sqrt(5))+sqrt(5)+1) (2) cos((4pi)/(15)) = 1/8(sqrt(30+6sqrt(5))-sqrt(5)+1) (3) ...

cos(pi/(16)) = 1/2sqrt(2+sqrt(2+sqrt(2))) (1) cos((3pi)/(16)) = 1/2sqrt(2+sqrt(2-sqrt(2))) (2) cos((5pi)/(16)) = 1/2sqrt(2-sqrt(2-sqrt(2))) (3) cos((7pi)/(16)) = ...

cos(pi/(30)) = 1/4sqrt(7+sqrt(5)+sqrt(6(5+sqrt(5)))) (1) cos((7pi)/(30)) = 1/4sqrt(7-sqrt(5)+sqrt(6(5-sqrt(5)))) (2) cos((11pi)/(30)) = 1/4sqrt(7+sqrt(5)-sqrt(6(5+sqrt(5)))) ...

A Calkin-Wilf tree is a special type of binary tree obtained by starting with the fraction 1/1 and iteratively adding a/(a+b) and (a+b)/b below each fraction a/b. The ...

A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...