Index numbers elucidated /

"Bibliographical note" at end of each chapter except chapter 9.

Uber den korper, dessen zahlen sich rational aus zwei quadratwu...

Thesis (doctoral)--

The old farmer and his almanack; being some observations on life and manners in New England a hundred years ago, suggested by reading the earlier numbers of Mr. Robert B. Thomas's Farmer's almanack, together with curious, instructive, and entertaining, as well as a variety of miscellaneous matter,

Mode of access: Internet.

Index numbers of who

Mode of access: Internet.

The theory of algebraic numbers.

Mode of access: Internet.

Introduction to philosophy : an inquiry after a rational system of scientific principles in their relation to ultimate reality /

Mode of access: Internet.

World prices and the building industry; index numbers of prices of 40 basic commodities for 14 countries in currency and in gold, and material on the building industry,

Mode of access: Internet.

The literature of working men; being the supplementary numbers of The Working man's friend, from March, 1850 to February, 1851, inclusive.

Mode of access: Internet.

Plankton diatom species-numbers as indicators of water quality,

Caption title.

1960 price list and supplement to volume 1 of Criswell's currency series : current market value on notes listed by Criswell's numbers.

Mode of access: Internet.

Masters in art [odd numbers, i.e.] Andrea del Sarto [Raphael Sanzio, The frescoes of Raphael, Michelangelo as a sculptor, Michelangelo as a painter, Leonardo da Vinci].

Mode of access: Internet.

Decisional Considerations in Left Ventricular Assist Device for Destination Therapy

Thesis (Ph.D.)--University of Washington, 2016-06

On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.