全文获取类型
收费全文 | 5144篇 |
免费 | 417篇 |
国内免费 | 325篇 |
专业分类
化学 | 206篇 |
晶体学 | 2篇 |
力学 | 25篇 |
综合类 | 139篇 |
数学 | 5241篇 |
物理学 | 273篇 |
出版年
2024年 | 16篇 |
2023年 | 97篇 |
2022年 | 161篇 |
2021年 | 129篇 |
2020年 | 196篇 |
2019年 | 223篇 |
2018年 | 214篇 |
2017年 | 198篇 |
2016年 | 123篇 |
2015年 | 90篇 |
2014年 | 173篇 |
2013年 | 437篇 |
2012年 | 189篇 |
2011年 | 292篇 |
2010年 | 295篇 |
2009年 | 435篇 |
2008年 | 377篇 |
2007年 | 270篇 |
2006年 | 311篇 |
2005年 | 213篇 |
2004年 | 196篇 |
2003年 | 167篇 |
2002年 | 161篇 |
2001年 | 150篇 |
2000年 | 138篇 |
1999年 | 135篇 |
1998年 | 115篇 |
1997年 | 76篇 |
1996年 | 46篇 |
1995年 | 51篇 |
1994年 | 39篇 |
1993年 | 27篇 |
1992年 | 25篇 |
1991年 | 15篇 |
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年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有5886条查询结果,搜索用时 15 毫秒
241.
Let G be a well covered graph, that is, all maximal independent sets of G have the same cardinality, and let ik denote the number of independent sets of cardinality k in G. We investigate the roots of the independence polynomial i(G, x) = ikxk. In particular, we show that if G is a well covered graph with independence number , then all the roots of i(G, x) lie in in the disk |z| (this is far from true if the condition of being well covered is omitted). Moreover, there is a family of well covered graphs (for each ) for which the independence polynomials have a root arbitrarily close to –. 相似文献
242.
Let V and W be n-dimensional vector spaces over GF(2). A function Q : V W is called crooked (a notion introduced by Bending and Fon-Der-Flaass) if it satisfies the following three properties:
We show that crooked functions can be used to construct distance regular graphs with parameters of a Kasami distance regular graph, symmetric 5-class association schemes similar to those recently constructed by de Caen and van Dam from Kasami graphs, and uniformly packed codes with the same parameters as the double error-correcting BCH codes and Preparata codes. 相似文献
243.
Zhongzhi Zhang Shuigeng Zhou Lichao Chen Jihong Guan Lujun Fang Yichao Zhang 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,59(1):99-107
We propose a geometric growth model for weighted
scale-free networks, which is controlled by two tunable parameters.
We derive exactly the main characteristics of the networks, which
are partially determined by the parameters. Analytical results
indicate that the resulting networks have power-law distributions of
degree, strength, weight and betweenness, a scale-free behavior for
degree correlations, logarithmic small average path length and
diameter with network size. The obtained properties are in agreement
with empirical data observed in many real-life networks, which shows
that the presented model may provide valuable insight into the real
systems. 相似文献
244.
Eva Tourís 《Journal of Mathematical Analysis and Applications》2011,380(2):865-881
In this paper we obtain the equivalence of the Gromov hyperbolicity between an extensive class of complete Riemannian surfaces with pinched negative curvature and certain kind of simple graphs, whose edges have length 1, constructed following an easy triangular design of geodesics in the surface. 相似文献
245.
Maria Elena Valcher 《Linear algebra and its applications》2010,432(4):980-1006
The aim of this paper is that of investigating the asymptotic exponential cone of a single Metzler matrix, introduced in [23], and of defining and analysing the new concept of asymptotic exponential cone of a family of Metzler matrices (along a certain direction). These results will provide necessary and/or sufficient conditions for the solvability of an interesting algebraic problem that arises in the context of continuous-time positive switched systems and, specifically, in the investigation of the reachability property [21,22,25]. 相似文献
246.
Ming-Chien Yang 《Applied mathematics and computation》2010,216(12):3754-3760
The n-dimensional star graph Sn is an attractive alternative to the hypercube graph and is a bipartite graph with two partite sets of equal size. Let Fv and Fe be the sets of faulty vertices and faulty edges of Sn, respectively. We prove that Sn − Fv − Fe contains a fault-free cycle of every even length from 6 to n! − 2∣Fv∣ with ∣Fv∣ + ∣Fe∣ ? n − 3 for every n ? 4. We also show that Sn − Fv − Fe contains a fault-free path of length n! − 2∣Fv∣ − 1 (respectively, n! − 2∣Fv∣ − 2) between two arbitrary vertices of Sn in different partite sets (respectively, the same partite set) with ∣Fv∣ + ∣Fe∣ ? n − 3 for every n ? 4. 相似文献
247.
We describe the spectrum of the Laplacian for a homogeneous graph acted on by a discrete group. This follows from a more general result which describes the spectrum of a convolution operator on a homogeneous space of a locally compact group. We also prove a version of Harnack inequality for a Schrödinger operator on an invariant homogeneous graph. 相似文献
248.
Nándor Sieben 《Czechoslovak Mathematical Journal》2008,58(3):683-692
The notion of Cayley color graphs of groups is generalized to inverse semigroups and groupoids. The set of partial automorphisms
of the Cayley color graph of an inverse semigroup or a groupoid is isomorphic to the original inverse semigroup or groupoid.
The groupoid of color permuting partial automorphisms of the Cayley color graph of a transitive groupoid is isomorphic to
the original groupoid. 相似文献
249.
K. V. Kostousov 《Algebra and Logic》2008,47(2):118-124
We point out a countable set of pairwise nonisomorphic Cayley graphs of the group ℤ4 that are limit for finite minimal vertex-primitive graphs admitting a vertex-primitive automorphism group containing a regular
Abelian normal subgroup.
Supported by RFBR grant No. 06-01-00378.
__________
Translated from Algebra i Logika, Vol. 47, No. 2, pp. 203–214, March–April, 2008. 相似文献
250.
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Z n, and most recently, sparse graphs. In this article, we extend these ideas to the more complex case of graphs which have a given degree sequence. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008 相似文献