全文获取类型
收费全文 | 7417篇 |
免费 | 734篇 |
国内免费 | 654篇 |
专业分类
化学 | 517篇 |
晶体学 | 15篇 |
力学 | 130篇 |
综合类 | 222篇 |
数学 | 7131篇 |
物理学 | 790篇 |
出版年
2024年 | 17篇 |
2023年 | 111篇 |
2022年 | 167篇 |
2021年 | 171篇 |
2020年 | 277篇 |
2019年 | 285篇 |
2018年 | 279篇 |
2017年 | 287篇 |
2016年 | 208篇 |
2015年 | 160篇 |
2014年 | 245篇 |
2013年 | 625篇 |
2012年 | 306篇 |
2011年 | 427篇 |
2010年 | 432篇 |
2009年 | 599篇 |
2008年 | 519篇 |
2007年 | 448篇 |
2006年 | 439篇 |
2005年 | 352篇 |
2004年 | 321篇 |
2003年 | 275篇 |
2002年 | 260篇 |
2001年 | 239篇 |
2000年 | 222篇 |
1999年 | 200篇 |
1998年 | 182篇 |
1997年 | 129篇 |
1996年 | 98篇 |
1995年 | 84篇 |
1994年 | 79篇 |
1993年 | 47篇 |
1992年 | 51篇 |
1991年 | 27篇 |
1990年 | 29篇 |
1989年 | 27篇 |
1988年 | 23篇 |
1987年 | 20篇 |
1986年 | 10篇 |
1985年 | 23篇 |
1984年 | 26篇 |
1983年 | 7篇 |
1982年 | 17篇 |
1981年 | 12篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 9篇 |
1976年 | 4篇 |
1975年 | 4篇 |
排序方式: 共有8805条查询结果,搜索用时 15 毫秒
31.
High-temperature series expansions of the susceptibility and second moment to 15th order are calculated for zero external field on the linear chain (LC), plane square (PSQ), simple cubic (SC), and body-centered cubic (BCC) lattices. Checks for specific models against pertinent work in the literature are detailed. 相似文献
32.
We investigate the conjecture that every circulant graph X admits a k‐isofactorization for every k dividing |E(X)|. We obtain partial results with an emphasis on small values of k. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006 相似文献
33.
图G称为K1,n-free图,如果它不含K1,n作为其导出子图.对K1,n-free图具有给定性质的[a,b]-因子涉及到最小度条件进行了研究,得到一个充分条件. 相似文献
34.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049 相似文献
35.
36.
Summary In [6], we introduced and investigated the notions of strong β-I-open sets and strong β-I-continuous functions in ideal topological spaces. In this paper, we investigate further their important properties. 相似文献
37.
Michael T. Jury David W. Kribs 《Proceedings of the American Mathematical Society》2005,133(1):213-222
Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.
38.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
39.
弱拓扑和强可容许拓扑之间的一个关系 总被引:2,自引:0,他引:2
本文对局部凸空间X及其对偶X′,建立了弱拓扑σ(X,X′)和强拓扑β(X,X′)之间的一个新关系,改进了有关(X,X′)--可容许拓扑全体上的不变性结果。 相似文献
40.
Francis K. Bell 《Journal of Graph Theory》2003,43(2):137-149
It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path Pt as a star complement for the eigenvalue ?2. The maximal graph is the line graph of Km,m if t = 2m?1, and of Km,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement Pr ∪ Ps or Pr ∪ Cs for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003 相似文献