Using the most recent updated physics, calibrated solar models have been computed with the new thermonuclear reaction rates of NACRE, the recently available European compilation. Comparisons with models computed with the reaction rates of Caughlan & Fowler (1988) and of Adelberger et al. (1998) are made for global structure, expected neutrinos fluxes, chemical composition and sound speed profil...

Fishburn, P. A subset S of N " = { 1,2,. , N} " is a discrete set of uniqueness if it is the only subset of N " with projections P,, Sets of uniqueness and additive sets are characterized by the absence of certain configurations in the lattice N ". The characterization shows that every additive set is a set of uniqueness. If n = 2, every set of uniqueness is also additive. However, when II 3 3,...

Traditional Adomian decomposition method (ADM) usually fails to solve singular initial value problems of Emden-Fowler type. To overcome this shortcoming, a new and effective modification of ADM that only requires calculation of the first Adomian polynomial is formally proposed in the present paper. Three singular initial value problems of Emden-Fowler type with , 1 α  , 2 and , 2  and have be...

Let X and Y be uncountable Polish spaces. A ⊂ X×Y represents a family of sets C provided each set in C occurs as an x-section of A. We say A uniquely represents C provided each set in C occurs exactly once as an xsection of A. A is universal for C if A represents C and every x-section of A is in C. A is uniquely universal for C if it is universal and uniquely represents C. We show that there is...

Let G be a graph with n vertices and suppose that for each vertex v in G, there exists a list of k colors, L(v), such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k–list colorable graph. Recently M. Mahdian and E.S. Mahmoodian characterized uniquely 2–list colorable graphs. Here we state some results which will pave the way in character...

Let G be a graph with ν vertices, and let S1, S2, . . . , Sν be a list of colors on its vertices, each of size k. If there exists a unique proper coloring for G from this list of colors, then G is called uniquely k–list colorable graph. We characterize all uniquely 2–list colorable graphs, and discuss uniquely k–list colorable graphs by introducing some open problems. We also show the connectio...