全文获取类型
收费全文 | 943篇 |
免费 | 73篇 |
国内免费 | 109篇 |
专业分类
化学 | 38篇 |
晶体学 | 2篇 |
力学 | 50篇 |
综合类 | 30篇 |
数学 | 845篇 |
物理学 | 160篇 |
出版年
2024年 | 8篇 |
2023年 | 12篇 |
2022年 | 19篇 |
2021年 | 23篇 |
2020年 | 30篇 |
2019年 | 36篇 |
2018年 | 32篇 |
2017年 | 36篇 |
2016年 | 30篇 |
2015年 | 24篇 |
2014年 | 36篇 |
2013年 | 71篇 |
2012年 | 43篇 |
2011年 | 61篇 |
2010年 | 60篇 |
2009年 | 63篇 |
2008年 | 77篇 |
2007年 | 55篇 |
2006年 | 71篇 |
2005年 | 43篇 |
2004年 | 33篇 |
2003年 | 37篇 |
2002年 | 44篇 |
2001年 | 22篇 |
2000年 | 27篇 |
1999年 | 21篇 |
1998年 | 24篇 |
1997年 | 19篇 |
1996年 | 12篇 |
1995年 | 15篇 |
1994年 | 8篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 8篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 4篇 |
1959年 | 1篇 |
排序方式: 共有1125条查询结果,搜索用时 15 毫秒
101.
The Merrifield-Simmons index of a graph is defined as the total number of its independent sets, including the empty set. Denote by G(n,k) the set of connected graphs with n vertices and k cut vertices. In this paper, we characterize the graphs with the maximum and minimum Merrifield-Simmons index, respectively, among all graphs in G(n,k) for all possible k values. 相似文献
102.
Birk Eisermann 《Discrete Applied Mathematics》2011,159(17):2165-2169
Golumbic, Monma, and Trotter showed that every tolerance graph for which no vertex neighborhood is contained in another vertex neighborhood is a bounded tolerance graph. We strengthen this result by weakening the neighborhood condition. In this way, more tolerance graphs can be recognized as bounded. Our argument relies on a variation of the concept of “assertive vertices”. 相似文献
103.
杨昭 《数学年刊A辑(中文版)》2011,32(2):237-244
设π:M~n→P~n是P~n上的小覆盖,S是P~n的任意一个n-1维截面.给出了π~(-1)(S)是n-1维闭子流形(或者两个相互同胚n-1维闭子流形的不交并),以及π~(-1)(S)是n-1维伪流形的充要条件. 相似文献
104.
Juan Alberto Rodriguez-Velazquez José María Sigarreta Ismael Gonzalez Yero Sergio Bermudo 《数学学报(英文版)》2011,27(3):497-504
A defensive (offensive) k-alliance in Γ = (V,E) is a set S ⊆ V such that every υ in S (in the boundary of S) has at least k more neighbors in S than it has in V / S. A set X ⊆ V is defensive (offensive) k-alliance free, if for all defensive (offensive) k-alliance S, S/X ≠ ∅, i.e., X does not contain any defensive (offensive) k-alliance as a subset. A set Y ⊆ V is a defensive (offensive) k-alliance cover, if for all defensive (offensive) k-alliance S, S ∩ Y ≠ ∅, i.e., Y contains at least one vertex from each defensive (offensive) k-alliance of Γ. In this paper we show several mathematical properties of defensive (offensive) k-alliance free sets and defensive (offensive) k-alliance cover sets, including tight bounds on their cardinality. 相似文献
105.
For every simple graph G,a class of multiple clique cluster-whiskered graphs Geπm is introduced,and it is shown that all such graphs are vertex decomposable;thus,the independence simplicial complex IndGeπm is sequentially Cohen-Macaulay.The properties of the graphs Geπm and Gπ constructed by Cook and Nagel are studied,including the enumeration of facets of the complex Ind Gπ and the calculation of Betti numbers of the cover ideal Ic(Geπ").We also prove that the complex △ =IndH is strongly shellable and pure for either a Boolean graph H =Bn or the full clique-whiskered graph H =Gw of G,which is obtained by adding a whisker to each vertex of G.This implies that both the facet ideal I(△) and the cover ideal Ic(H) have linear quotients. 相似文献
106.
Suppose that the underlying field is of characteristic different from 2 and 3. We first prove that the so-called stem deformations of a free presentation of a finite-dimensional Lie superalgebra L exhaust all the maximal stem extensions of L; up to equivalence of extensions. Then we prove that multipliers and covers always exist for a Lie superalgebra and they are unique up to superalgebra isomorphisms. Finally, we describe the multipliers, covers, and maximal stem extensions of Heisenberg superalgebras and model filiform Lie superalgebras. 相似文献
107.
A covering array of size N, strength t, degree k, and order υ is a k × N array on υ symbols in which every t × N subarray contains every possible t × 1 column at least once. We present explicit constructions, constructive upper bounds on the size of various covering arrays, and compare our results with those of a commercial product. Applications of covering arrays include software testing, drug screening, and data compression. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 217–238, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10002 相似文献
108.
我们证明了有限域上的一类方程组解的个数与图的顶点着色数有密切关系,而这又对许多着色问题的产生了许多应用。另外,我们也用图论的一些技巧解决了数论中一些问题。 相似文献
109.
Franz Strobl 《Journal of Theoretical Probability》1995,8(4):825-831
The empirical discrepancy is defined as a supremum over a class of functions of a collection of centered sample averages.
For uncountable classes the discrepancy need not be measurable, and distributional assertions can become dependent on the
structure of the underlying probability space. This paper shows that one such assertion—the reversed sub-martingale property—is
valid when interpreted in terms of measurable cover functions for the canonical model, but that it can fail in other constructions
of the underlying model. 相似文献
110.
G. Casnati 《Geometriae Dedicata》2006,119(1):169-179
We give a method for producing examples of Calabi–Yau threefolds as covers of degree d ≤ 8 of almost-Fano threefolds, computing explicitely their Euler– Poincaré characteristic. Such a method generalizes the well-knownclassical construction of Calabi–Yau threefolds as double covers of the projective space branched along octic surfaces. 相似文献