全文获取类型
收费全文 | 5330篇 |
免费 | 434篇 |
国内免费 | 343篇 |
专业分类
化学 | 210篇 |
晶体学 | 2篇 |
力学 | 32篇 |
综合类 | 148篇 |
数学 | 5401篇 |
物理学 | 314篇 |
出版年
2024年 | 23篇 |
2023年 | 98篇 |
2022年 | 174篇 |
2021年 | 132篇 |
2020年 | 200篇 |
2019年 | 227篇 |
2018年 | 218篇 |
2017年 | 207篇 |
2016年 | 128篇 |
2015年 | 93篇 |
2014年 | 179篇 |
2013年 | 442篇 |
2012年 | 193篇 |
2011年 | 303篇 |
2010年 | 302篇 |
2009年 | 443篇 |
2008年 | 393篇 |
2007年 | 281篇 |
2006年 | 330篇 |
2005年 | 227篇 |
2004年 | 209篇 |
2003年 | 175篇 |
2002年 | 166篇 |
2001年 | 158篇 |
2000年 | 143篇 |
1999年 | 146篇 |
1998年 | 121篇 |
1997年 | 78篇 |
1996年 | 47篇 |
1995年 | 52篇 |
1994年 | 42篇 |
1993年 | 28篇 |
1992年 | 25篇 |
1991年 | 17篇 |
1990年 | 12篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 4篇 |
1974年 | 2篇 |
排序方式: 共有6107条查询结果,搜索用时 15 毫秒
71.
Ryo Nikkuni 《Mathematische Nachrichten》2007,280(8):897-906
Two spatial embeddings of a graph are said to be delta (resp. sharp) edge‐homotopic if they are transformed into each other by self delta (resp. sharp) moves and ambient isotopies. We show that any two spatial embeddings of a graph are delta (resp. sharp) edge‐homotopic if and only if the graph does not contain a subgraph which is homeomorphic to the theta graph or the disjoint union of two 1‐spheres, or equivalently G is homeomorphic to a bouquet. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
72.
73.
本文解决了超立方体的Laplace矩阵的谱问题.n维超立方体Q。的Laplace矩阵L(Q)的谱specL(Qn)。[0 2 4…2n Cn^0 Cn^1 Cn^2 … Cn^n],.其中2t(t=0,1,2,…,n)为L(Qn)的n+1个不同的特征值,二项式系数Cn为特征值2t的重数. 相似文献
74.
75.
Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??1 and ??2, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??1 or ??2, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??1 or ??2. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, ti (0 ≤ i ≤ d) satisfy (s, t2, t3) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006 相似文献
76.
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms 总被引:2,自引:0,他引:2
Hoang Tuy 《Journal of Global Optimization》1991,1(1):23-36
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions. 相似文献
77.
给出了半无爪图(quasi-claw-freegraph)点泛圈性方面的两个结果,作为推论,可得到D.Oberly,D.Sumner,L.Clark等人的相关结果. 相似文献
78.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
79.
Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w,u), (w,v), (u,x), and (v,x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not contain C4 as an induced subgraph, it is an interval graph. We also show that any interval graph together with enough isolated vertices is the CCE graph of some doubly partial order. 相似文献
80.
We prove that if T is a tournament of order n > 6 in which any 4-sub-tournament is hamiltonian or transitive, then T is reconstructible in the sense of Ulam. 相似文献