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

C. Kimberling has extensively tabulated and enumerated the properties of triangle centers (Kimberling 1994, 1998, and online), denoting the nth center in his numbering scheme ...

The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...

Given any tree T having v vertices of vertex degrees of 1 and 3 only, form an n-expansion by taking n disjoint copies of T and joining corresponding leaves by an n-cycle ...

The vertical length of an object from top to bottom.

A Pisot number is a positive algebraic integer greater than 1 all of whose conjugate elements have absolute value less than 1. A real quadratic algebraic integer greater than ...

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...