986 resultados para On s-Numbers


Relevância:

40.00% 40.00%

Publicador:

Resumo:

Cover title.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Caption title: nos. 1-4, Atlantic journal, and firend of knowledge; a cyclopedic journal and review of universal science and knowledge: historical, natural, and medical arts and sciences. -- nos. 5-8, Atlantic journal and friend of knowledge; a quarterly journal of historical and natural sciences, useful knowledge, &c.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Half-title.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

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.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

This work was presented in part at the 8th International Conference on Finite Fields and Applications Fq^8 , Melbourne, Australia, 9-13 July, 2007.