全文获取类型
收费全文 | 2029篇 |
免费 | 246篇 |
国内免费 | 224篇 |
专业分类
化学 | 132篇 |
晶体学 | 2篇 |
力学 | 52篇 |
综合类 | 58篇 |
数学 | 2044篇 |
物理学 | 211篇 |
出版年
2024年 | 3篇 |
2023年 | 25篇 |
2022年 | 45篇 |
2021年 | 30篇 |
2020年 | 68篇 |
2019年 | 68篇 |
2018年 | 66篇 |
2017年 | 77篇 |
2016年 | 57篇 |
2015年 | 52篇 |
2014年 | 106篇 |
2013年 | 169篇 |
2012年 | 107篇 |
2011年 | 133篇 |
2010年 | 118篇 |
2009年 | 172篇 |
2008年 | 139篇 |
2007年 | 130篇 |
2006年 | 139篇 |
2005年 | 122篇 |
2004年 | 104篇 |
2003年 | 79篇 |
2002年 | 87篇 |
2001年 | 54篇 |
2000年 | 51篇 |
1999年 | 64篇 |
1998年 | 49篇 |
1997年 | 44篇 |
1996年 | 25篇 |
1995年 | 23篇 |
1994年 | 10篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1990年 | 3篇 |
1989年 | 7篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1986年 | 3篇 |
1985年 | 8篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1959年 | 1篇 |
1957年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有2499条查询结果,搜索用时 15 毫秒
131.
In this paper, we construct a new Roper-Suffridge extension operator Φr n,β1,,βn(f)(z) = F(z) = ((rf(z1/r)/z1)β1z1,(rf(z1/r)/z1)β2z2,...,(rf(z1/r)/z1)βnzn)',where f is a normalized locally biholomorphic function on the unit disc D, r = sup{|z1| : z =(z1, ···, zn) ∈Ω}, β1∈ [0, 1], 0 ≤βk≤β1, k = 2, ···, n, then we prove it can preserve the property of spirallikeness of type β, almost starlikeness of order α and starlikeness of orderα on bounded complete Reinhardt domain Ω, respectively. 相似文献
132.
Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications
下载免费PDF全文
![点击此处可从《Journal of Graph Theory》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In an earlier article the authors constructed a hamilton cycle embedding of in a nonorientable surface for all and then used these embeddings to determine the genus of some large families of graphs. In this two‐part series, we extend those results to orientable surfaces for all . In part II, a voltage graph construction is presented for building embeddings of the complete tripartite graph on an orientable surface such that the boundary of every face is a hamilton cycle. This construction works for all such that p is prime, completing the proof started by part I (which covers the case ) that there exists an orientable hamilton cycle embedding of for all , . These embeddings are then used to determine the genus of several families of graphs, notably for and, in some cases, for . 相似文献
133.
José Bonet Carmen Fernández Antonio Galbis Juan M. Ribera 《Journal of Mathematical Analysis and Applications》2014
We study Schauder frames in Fréchet spaces and their duals, as well as perturbation results. We define shrinking and boundedly complete Schauder frames on a locally convex space, study the duality of these two concepts and their relation with the reflexivity of the space. We characterize when an unconditional Schauder frame is shrinking or boundedly complete in terms of properties of the space. Several examples of concrete Schauder frames in function spaces are also presented. 相似文献
134.
135.
Uniqueness of complete spacelike hypersurfaces via their higher order mean curvatures in a conformally stationary spacetime
下载免费PDF全文
![点击此处可从《Mathematische Nachrichten》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Henrique Fernandes de Lima Marco Antonio Lázaro Velásquez 《Mathematische Nachrichten》2014,287(11-12):1223-1240
We study complete noncompact spacelike hypersurfaces immersed into conformally stationary spacetimes, that is, Lorentzian manifolds endowed with a timelike conformal vector field V. In this setting, by using as main analytical tool a suitable maximum principle for complete noncompact Riemannian manifolds, we establish new characterizations of totally umbilical hypersurfaces in terms of their higher order mean curvatures. For instance, supposing an appropriated restriction on the norm of the tangential component of the vector field V, we are able to show that such hypersurfaces must be totally umbilical provided that either some of their higher order mean curvatures are linearly related or one of them is constant. Applications to the so‐called generalized Robertson‐Walker spacetimes are given. In particular, we extend to the Lorentzian context a classical result due to Jellett 29 . 相似文献
136.
Carl Johan Casselgren 《Random Structures and Algorithms》2014,44(3):317-327
Let G = G(n) be a graph on n vertices with maximum degree bounded by some absolute constant Δ. Assign to each vertex v of G a list L(v) of colors by choosing each list uniformly at random from all k‐subsets of a color set of size . Such a list assignment is called a random ‐list assignment. In this paper, we are interested in determining the asymptotic probability (as ) of the existence of a proper coloring ? of G, such that for every vertex v of G. We show, for all fixed k and growing n, that if , then the probability that G has such a proper coloring tends to 1 as . A similar result for complete graphs is also obtained: if and L is a random ‐list assignment for the complete graph Kn on n vertices, then the probability that Kn has a proper coloring with colors from the random lists tends to 1 as .Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 317‐327, 2014 相似文献
137.
Po‐Shen Loh 《Random Structures and Algorithms》2014,44(3):328-354
One of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erd?s‐Rényi random graph Gn,p is around . Much research has been done to extend this to increasingly challenging random structures. In particular, a recent result by Frieze determined the asymptotic threshold for a loose Hamilton cycle in the random 3‐uniform hypergraph by connecting 3‐uniform hypergraphs to edge‐colored graphs. In this work, we consider that setting of edge‐colored graphs, and prove a result which achieves the best possible first order constant. Specifically, when the edges of Gn,p are randomly colored from a set of (1 + o(1))n colors, with , we show that one can almost always find a Hamilton cycle which has the additional property that all edges are distinctly colored (rainbow).Copyright © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 44, 328‐354, 2014 相似文献
138.
Let G be a connected graph with maximum degree Δ≥ 3.We investigate the upper bound for the chromatic number χγ(G) of the power graph Gγ.It was proved that χγ(G) ≤Δ(Δ-1)γ-1Δ-2+ 1 =:M + 1,where the equality holds if and only if G is a Moore graph.If G is not a Moore graph,and G satisfies one of the following conditions:(1) G is non-regular,(2) the girth g(G) ≤ 2γ- 1,(3)g(G) ≥ 2γ + 2,and the connectivity κ(G) ≥ 3 if γ≥ 3,κ(G) ≥ 4 but g(G) 6 if γ = 2,(4) Δis sufficiently larger than a given number only depending on γ,then χγ(G) ≤ M- 1.By means of the spectral radius λ1(G) of the adjacency matrix of G,it was shown that χ2(G) ≤λ1(G)2+ 1,where the equality holds if and only if G is a star or a Moore graph with diameter 2 and girth 5,and χγ(G)λ1(G)γ+1 ifγ≥3. 相似文献
139.
CHEN XIANG-EN HE WEN-YU LI ZE-PENG YAO BING 《数学研究通讯:英文版》2014,(3):222-236
Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C(u)=C(v) for any two different vertices u and v of V (G), then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt(G), and is called the VDIET chromatic number of G. We get the VDIET chromatic numbers of cycles and wheels, and propose related conjectures in this paper. 相似文献
140.
《Journal of computational science》2014,5(1):1-11
Partial differential equations can be discretized using a regular Cartesian grid and a stencil-based method to approximate the partial derivatives. The computational effort for determining the associated Jacobian matrix can be reduced. This reduction can be modeled as a (grid) coloring problem. Currently, this problem is solved by using a heuristic approach for general graphs or by developing a formula for every single stencil. We introduce a sub-exponential algorithm using the Lipton–Tarjan separator in a divide-and-conquer approach to compute an optimal coloring. The practical relevance of the algorithm is evaluated when compared with an exponential algorithm and a greedy heuristic. 相似文献