** Periodic Graphs ( Geometry )

** Graphs of bounded genus ( Note: planar graphs are graphs of genus 0 )

** Graphs with bounded eigenvalue multiplicity

** A uniform space is compact if and only if it is complete and totally bounded.

** Lune of Hippocrates, in geometry a plane region bounded by arcs of circles and amenable to quadrature

** Analytic capacity, a number that denotes how big a certain bounded analytic function can become

** bounded on the north by the City of Ottawa, and on the east, south and west by a line drawn from the boundary south along Conroy Road, west along Davidson Road and Lester Road, south along Albion Road, west along the road allowance between lots 10 and 11, Concession 3, south along the Canadian Pacific Railway line, west along Leitrim Road, north along Limebank Road and River Road to the Ottawa city limit ;

** bounded on the west by the Gloucester city limit, and on the north, east and south by a line drawn east from the limit near Blair Road, south along Blair Road, west along Innes Road, and south along a hydroelectric transmission line situated east of Meadowvale Lane to the western city limit ;

** the part bounded on the north by the City of Ottawa, and on the east, south and west by a line drawn from the border south along Conroy Road, west along Davidson Road and Lester Road, south along the Canadian Pacific Railway, west along Leitrim Road, and north along Limebank Road to the City of Ottawa ;

** the part bounded on the west by the western city limit, and on the north, east and south by a line drawn from the city limit near Mowat Road east to Blair Road, south along Blair Road, west along Innes Road, and south along the transmission line situated east of Meadowvale Lane to the western city limit.

** the part bounded on the north by the Quebec border, and on the west by the western city limit, and on the north, east and south by a line drawn from the city limit east along Montreal Road and Highway 17, north along Green's Creek and due north to the Quebec boundary.

** Eugene M. Luks for a polynomial time graph isomorphism algorithm for graphs of bounded maximum degree.

** k-Contractible graphs ( a generalization of bounded degree and bounded genus )

** Color-preserving isomorphism of colored graphs with bounded color multiplicity ( i. e., at most k vertices have the same color for a fixed k ) is in class NC, which is a subclass of P.

** Fronteira, Minas Gerais ( named after the frontier of Minas Gerais which is bounded by São Paulo state ), Minas Gerais

** a linear equation has degree one,

** quadratic equation has degree two,

** cubic equation has degree three,

** quartic equation has degree four,

** quintic equation has degree five,

** Two-dimensional plane of the screen ( 5 %) — Does the cut respect the 180 degree rule?

** Degrees: Masters degree in Finance ( MSF ), Master of Financial Economics, Master of Finance & Control ( MFC ), Master Financial Manager ( MFM ), Master of Financial Administration ( MFA )

** Prohibited degree of kinship

** The psychogram is the only system to have been taught as part of an academic degree, at an accredited institution in the United States.

** XI °— Initiate of the Eleventh Degree ( This degree is technical, and has no relation to the general plan of the Order )

** There is a differing degree of separation in the models between the winter sub-tropical jet and the polar night jet.

** School of Early Childhood Teacher Education: Formerly part of the College and a standalone kindergarten teachers college, the school offers four qualifications – two diplomas, one single degree and one conjoint degree ( BA / BTeach ).

** Daniel Loss and David P. DiVincenzo proposed the Loss-DiVincenzo quantum computer, using as qubits the intrinsic spin-1 / 2 degree of freedom of individual electrons confined to quantum dots.

** The price floor is determined by production factors like costs ( often only variable costs are taken into account ), economies of scale, marginal cost, and degree of operating leverage

** As another variation, figure out every disaster that might occur due to failure of the biosphere, to lesser or greater degree, and calculate the price of insurance against all of it.

** Bachelor of Education in Adult Education undergraduate degree and certificate program

** there also exist 730 associated communes ( as of January 2006 ), formerly independent communes which were merged with larger communes but have retained some limited degree of autonomy ( e. g. the commune of Lomme which was absorbed by Lille in 2000 and transformed into an " associated commune " inside the commune of Lille )

** The murder was committed during the commission of, attempt of, or escape from a specified felony ( aggravated kidnapping, second degree kidnapping, aggravated escape, aggravated arson, aggravated rape, forcible rape, aggravated burglary, armed robbery, assault by drive-by shooting, first degree robbery, second degree robbery, simple robbery, terrorism, cruelty to juveniles, or second degree cruelty to juveniles ).

** First degree murder is killing another person by:

** The Esoteric Hierarchy section, including the 12th degree as an introduction to a new entire new section called the Ordo Summum Bonum

** In the case of narrow-band bandpass filters, the Q determines the-3dB bandwidth but also the degree of rejection of frequencies far removed from the center frequency ; if these two requirements are in conflict then a staggered-tuning bandpass filter may be needed.

A chain complex is bounded above if all degrees above some fixed degree N are 0, and is bounded below if all degrees below some fixed degree are 0.

Note that the vertex degrees must be finite, but need not be bounded: it is possible to have one vertex of degree 10, another of degree 100, a third of degree 1000, and so on.

If a graph has vertices with high degree then it necessarily will have small angular resolution, but the angular resolution can be bounded below by a function of the degree.

Cubic graphs have slope number at most four, but graphs of degree five may have unbounded slope number ; it remains open whether the slope number of degree-4 graphs is bounded.

For instance, for sparse graphs ( graphs in which the number of edges is at most a constant times the number of vertices in any subgraph ), the maximum clique has bounded size and may be found exactly in linear time ; however, for the same classes of graphs, or even for the more restricted class of bounded degree graphs, finding the maximum independent set is MAXSNP-complete, implying that, for some constant c ( depending on the degree ) it is NP-hard to find an approximate solution that comes within a factor of c of the optimum.

This product Π is a monic polynomial of degree n. It may be shown that the maximum absolute value of any such polynomial is bounded below by 2 < sup > 1 − n </ sup >.

In more practical terms, it is the class of problems that can be solved to any fixed degree of accuracy by running a randomized, polynomial-time algorithm a sufficient ( but bounded ) number of times.

polynomial of degree, exponentials, or bounded functions on

Twice the knot genus is bounded below by the degree of the Alexander polynomial.

It consisted the Provisional District of Mackenzie bounded on the west by the Yukon Territory ; on the south by the parallel of the sixtieth degree of north latitude ; on the east by the second meridian in the system of Dominion Land surveys, and on the north by the continental shore of the Arctic Ocean.

: Wernicke's Theorem: Assume G is planar, nonempty, has no faces bounded by two edges, and has minimum degree 5.

All known examples are automorphic L-functions, and the reciprocals of F < sub > p </ sub >( s ) are polynomials in p < sup >− s </ sub > of bounded degree.