TOPICS
Search

Search Results for ""


401 - 410 of 1716 for cartesian equationSearch Results
The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...
A Bland-Altman plot is a data plotting method which simultaneously presents data sets from two different tests in a way that allows for easier determination of whether the ...
The cross polytope beta_n is the regular polytope in n dimensions corresponding to the convex hull of the points formed by permuting the coordinates (+/-1, 0, 0, ..., 0). A ...
Guilloché patterns are spirograph-like curves that frame a curve within an inner and outer envelope curve. They are used on banknotes, securities, and passports worldwide for ...
Orthogonal circles are orthogonal curves, i.e., they cut one another at right angles. By the Pythagorean theorem, two circles of radii r_1 and r_2 whose centers are a ...
A general plane quartic curve is a curve of the form (1) Examples include the ampersand curve, bean curve, bicorn, bicuspid curve, bifoliate, bifolium, bitangent-rich curve, ...
The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...
The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...
Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...
The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...
1 ... 38|39|40|41|42|43|44 ... 172 Previous Next

...