全文获取类型
收费全文 | 6630篇 |
免费 | 753篇 |
国内免费 | 438篇 |
专业分类
化学 | 402篇 |
晶体学 | 14篇 |
力学 | 100篇 |
综合类 | 141篇 |
数学 | 5294篇 |
物理学 | 677篇 |
无线电 | 1193篇 |
出版年
2024年 | 19篇 |
2023年 | 121篇 |
2022年 | 198篇 |
2021年 | 168篇 |
2020年 | 238篇 |
2019年 | 260篇 |
2018年 | 243篇 |
2017年 | 274篇 |
2016年 | 176篇 |
2015年 | 163篇 |
2014年 | 254篇 |
2013年 | 549篇 |
2012年 | 314篇 |
2011年 | 386篇 |
2010年 | 383篇 |
2009年 | 531篇 |
2008年 | 481篇 |
2007年 | 372篇 |
2006年 | 411篇 |
2005年 | 303篇 |
2004年 | 275篇 |
2003年 | 236篇 |
2002年 | 221篇 |
2001年 | 194篇 |
2000年 | 184篇 |
1999年 | 166篇 |
1998年 | 141篇 |
1997年 | 119篇 |
1996年 | 76篇 |
1995年 | 69篇 |
1994年 | 63篇 |
1993年 | 44篇 |
1992年 | 37篇 |
1991年 | 22篇 |
1990年 | 16篇 |
1989年 | 21篇 |
1988年 | 17篇 |
1987年 | 13篇 |
1986年 | 5篇 |
1985年 | 13篇 |
1984年 | 16篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有7821条查询结果,搜索用时 437 毫秒
81.
82.
单循环赛赛程安排的一个图论方法 总被引:2,自引:0,他引:2
唐保祥 《数学的实践与认识》2004,34(5):120-125
利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案 相似文献
83.
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) 相似文献
84.
85.
本文解决了超立方体的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的重数. 相似文献
86.
87.
Nanometer scale Al/AlN multilayers have been prepared by dc magnetron sputtering technique with a columnar target. A set of Al/AlN multilayers with the Al layer thickness of 2.9 nm and the AlN layer thickness variation from 1.13 to 6.81 nm were determined. Low angle X-ray diffraction (LAXRD) was used to analyze the layered structure of multilayers. The phase structure of the coatings was investigated with grazing angle XRD (GAXRD). Mechanical properties of these multilayers were thoroughly studied using a nanoindentation and ball-on-disk micro-tribometer. It was found that the multilayer hardness and reduced modulus showed no strong dependence on the AlN layer thickness. Al2.9 nm/AlN1.13 nm multilayer had more excellent tribological properties than single layers and other proportion multilayers with a lowest friction coefficient of 0.15. And the tribological properties of all the multilayers are superior to the AlN single layer. 相似文献
88.
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 相似文献
89.
给出了半无爪图(quasi-claw-freegraph)点泛圈性方面的两个结果,作为推论,可得到D.Oberly,D.Sumner,L.Clark等人的相关结果. 相似文献
90.
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 相似文献