全文获取类型
收费全文 | 6713篇 |
免费 | 672篇 |
国内免费 | 397篇 |
专业分类
化学 | 331篇 |
晶体学 | 20篇 |
力学 | 153篇 |
综合类 | 191篇 |
数学 | 6035篇 |
物理学 | 1052篇 |
出版年
2024年 | 17篇 |
2023年 | 115篇 |
2022年 | 205篇 |
2021年 | 176篇 |
2020年 | 244篇 |
2019年 | 265篇 |
2018年 | 251篇 |
2017年 | 273篇 |
2016年 | 200篇 |
2015年 | 144篇 |
2014年 | 290篇 |
2013年 | 560篇 |
2012年 | 256篇 |
2011年 | 385篇 |
2010年 | 375篇 |
2009年 | 546篇 |
2008年 | 508篇 |
2007年 | 374篇 |
2006年 | 399篇 |
2005年 | 299篇 |
2004年 | 255篇 |
2003年 | 218篇 |
2002年 | 203篇 |
2001年 | 197篇 |
2000年 | 177篇 |
1999年 | 164篇 |
1998年 | 141篇 |
1997年 | 99篇 |
1996年 | 72篇 |
1995年 | 66篇 |
1994年 | 50篇 |
1993年 | 38篇 |
1992年 | 36篇 |
1991年 | 24篇 |
1990年 | 19篇 |
1989年 | 18篇 |
1988年 | 24篇 |
1987年 | 16篇 |
1986年 | 6篇 |
1985年 | 15篇 |
1984年 | 24篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 4篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有7782条查询结果,搜索用时 31 毫秒
41.
For a graph G and a positive integer m, G(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m2 edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G(2) does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G(2) does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003 相似文献
42.
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. 相似文献
43.
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). 相似文献
44.
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. 相似文献
45.
全固态多波长飞秒脉冲激光系统 总被引:1,自引:1,他引:0
利用棱镜对引进频谱空间啁啾来补偿飞秒脉冲激光二次谐波产生中的相位失配,提高了倍频效率建立了一套全固态、多波长(1065nm, 532nm,823.1nm, 402nm)飞秒脉冲激光系统自制的Nd:YVO4激光器输出532nm绿光激光,最高平均功率可达5.6W当用2.5W绿光激光泵浦时,从自制的钛宝石激光器及经BBO倍频可分别输出中心波长为823.1nm和402nm,平均功率300mW和73mW,谱宽32.3nm和5.1nm,脉宽22fs和33.3fs、重复率108MHz的近红外和蓝光激光整个系统具有结构紧凑、倍频效率高、运行稳定的特点. 相似文献
46.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for
actually finding such a partition by our proof. 相似文献
47.
Xuechao Li 《Graphs and Combinatorics》2006,22(4):503-513
In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of
Luo [6] and Y. Zhao [12]. 相似文献
48.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
49.
50.
R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation. 相似文献