全文获取类型
收费全文 | 6200篇 |
免费 | 570篇 |
国内免费 | 448篇 |
专业分类
化学 | 270篇 |
晶体学 | 2篇 |
力学 | 40篇 |
综合类 | 163篇 |
数学 | 6177篇 |
物理学 | 566篇 |
出版年
2024年 | 18篇 |
2023年 | 112篇 |
2022年 | 188篇 |
2021年 | 144篇 |
2020年 | 224篇 |
2019年 | 261篇 |
2018年 | 238篇 |
2017年 | 232篇 |
2016年 | 153篇 |
2015年 | 115篇 |
2014年 | 206篇 |
2013年 | 541篇 |
2012年 | 252篇 |
2011年 | 357篇 |
2010年 | 345篇 |
2009年 | 495篇 |
2008年 | 460篇 |
2007年 | 344篇 |
2006年 | 367篇 |
2005年 | 280篇 |
2004年 | 245篇 |
2003年 | 223篇 |
2002年 | 205篇 |
2001年 | 201篇 |
2000年 | 181篇 |
1999年 | 183篇 |
1998年 | 157篇 |
1997年 | 105篇 |
1996年 | 58篇 |
1995年 | 71篇 |
1994年 | 45篇 |
1993年 | 34篇 |
1992年 | 33篇 |
1991年 | 21篇 |
1990年 | 15篇 |
1989年 | 22篇 |
1988年 | 16篇 |
1987年 | 14篇 |
1986年 | 6篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有7218条查询结果,搜索用时 171 毫秒
81.
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 相似文献
82.
In this paper, we study the central limit theorem and its weak invariance principle for sums of a stationary sequence of random
variables, via a martingale decomposition. Our conditions involve the conditional expectation of sums of random variables
with respect to the distant past. The results contribute to the clarification of the central limit question for stationary
sequences.
Magda Peligrad is supported in part by a Charles Phelps Taft research support grant at the Univeristy of Cincinnati and the
NSA grant H98230-05-1-0066. 相似文献
83.
给出了半无爪图(quasi-claw-freegraph)点泛圈性方面的两个结果,作为推论,可得到D.Oberly,D.Sumner,L.Clark等人的相关结果. 相似文献
84.
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 相似文献
85.
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. 相似文献
86.
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. 相似文献
87.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
88.
本证明了当(a,b)不属于{(1,8),(2,4),(3,6),(4,4),(2s^2-s,2s^2 s))时,L^m(Ka,b)以谱为特征,其中a≤b,s≥2. 相似文献
89.
设G是一个图 .设g和f是两个定义在V(G)上的整值函数使得对V(G)所有顶点x有g(x) ≤f(x) .图G被称为 (g ,f,n) 临界图 ,如果删去G的任意n个顶点后的子图都含有G的 (g ,f) 因子 .本文给出了图是 (a ,b ,n) 临界图几个充分条件 ,即度和邻域条件 .进一步指出这些条件是最佳的 . 相似文献
90.
Siaw-Lynn Ng 《Designs, Codes and Cryptography》2003,30(1):5-19
Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing 相似文献