全文获取类型
收费全文 | 5733篇 |
免费 | 531篇 |
国内免费 | 363篇 |
专业分类
化学 | 324篇 |
晶体学 | 9篇 |
力学 | 138篇 |
综合类 | 149篇 |
数学 | 5366篇 |
物理学 | 641篇 |
出版年
2024年 | 16篇 |
2023年 | 99篇 |
2022年 | 165篇 |
2021年 | 141篇 |
2020年 | 212篇 |
2019年 | 236篇 |
2018年 | 220篇 |
2017年 | 215篇 |
2016年 | 138篇 |
2015年 | 111篇 |
2014年 | 210篇 |
2013年 | 468篇 |
2012年 | 213篇 |
2011年 | 336篇 |
2010年 | 329篇 |
2009年 | 467篇 |
2008年 | 425篇 |
2007年 | 307篇 |
2006年 | 346篇 |
2005年 | 246篇 |
2004年 | 231篇 |
2003年 | 189篇 |
2002年 | 192篇 |
2001年 | 170篇 |
2000年 | 165篇 |
1999年 | 162篇 |
1998年 | 130篇 |
1997年 | 93篇 |
1996年 | 59篇 |
1995年 | 58篇 |
1994年 | 46篇 |
1993年 | 41篇 |
1992年 | 33篇 |
1991年 | 23篇 |
1990年 | 18篇 |
1989年 | 21篇 |
1988年 | 17篇 |
1987年 | 12篇 |
1986年 | 7篇 |
1985年 | 15篇 |
1984年 | 12篇 |
1983年 | 5篇 |
1982年 | 11篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6627条查询结果,搜索用时 257 毫秒
31.
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.
32.
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 相似文献
33.
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 相似文献
34.
分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题.基于断点图的概念,给出一个时间复杂性为O(max{b^(π),nb(π)}),空间复杂性为0(n)的求其近似最优解的算法.其中n为基因组中基因个数,π=(π1,π2,…,πn)表示n个基因的一种排列,b(π)表示排列π中的断点数.数据实验的结果表明,该近似算法可以求得较好的结果. 相似文献
35.
36.
In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the
Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead
and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph.
This revised version was published online in September 2006 with corrections to the Cover Date. 相似文献
37.
Yao Ping HOU 《数学学报(英文版)》2005,21(4):955-960
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated. 相似文献
38.
For given a graph H, a graphic sequence π = (d
1, d
2,..., d
n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K
5 − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to
be potentially K
5-graphic, where K
r is a complete graph on r vertices and K
r-e is a graph obtained from K
r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence
π to be potentially K
6-graphic.
Project supported by National Natural Science Foundation of China (No. 10401010). 相似文献
39.
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon. 相似文献
40.