全文获取类型
收费全文 | 11125篇 |
免费 | 708篇 |
国内免费 | 929篇 |
专业分类
化学 | 326篇 |
晶体学 | 5篇 |
力学 | 133篇 |
综合类 | 170篇 |
数学 | 6208篇 |
物理学 | 519篇 |
综合类 | 5401篇 |
出版年
2024年 | 35篇 |
2023年 | 155篇 |
2022年 | 245篇 |
2021年 | 213篇 |
2020年 | 289篇 |
2019年 | 308篇 |
2018年 | 293篇 |
2017年 | 282篇 |
2016年 | 189篇 |
2015年 | 221篇 |
2014年 | 392篇 |
2013年 | 715篇 |
2012年 | 489篇 |
2011年 | 599篇 |
2010年 | 551篇 |
2009年 | 734篇 |
2008年 | 701篇 |
2007年 | 712篇 |
2006年 | 725篇 |
2005年 | 597篇 |
2004年 | 475篇 |
2003年 | 450篇 |
2002年 | 412篇 |
2001年 | 379篇 |
2000年 | 357篇 |
1999年 | 340篇 |
1998年 | 315篇 |
1997年 | 237篇 |
1996年 | 194篇 |
1995年 | 186篇 |
1994年 | 148篇 |
1993年 | 132篇 |
1992年 | 134篇 |
1991年 | 111篇 |
1990年 | 92篇 |
1989年 | 96篇 |
1988年 | 81篇 |
1987年 | 51篇 |
1986年 | 27篇 |
1985年 | 27篇 |
1984年 | 17篇 |
1983年 | 7篇 |
1982年 | 16篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
61.
Cao H. P. Chen G. Grechkoseeva M. A. Mazurov V. D. Shi W. J. Vasil'ev A. V. 《Siberian Mathematical Journal》2004,45(6):1031-1035
The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F
4(2
m
) is recognizable by spectrum. 相似文献
62.
Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp. 相似文献
63.
An m‐covering of a graph G is a spanning subgraph of G with maximum degree at most m. In this paper, we shall show that every 3‐connected graph on a surface with Euler genus k ≥ 2 with sufficiently large representativity has a 2‐connected 7‐covering with at most 6k ? 12 vertices of degree 7. We also construct, for every surface F2 with Euler genus k ≥ 2, a 3‐connected graph G on F2 with arbitrarily large representativity each of whose 2‐connected 7‐coverings contains at least 6k ? 12 vertices of degree 7. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 26–36, 2003 相似文献
64.
66.
本文研究的问题是确定f(p,B)的值,也就是给定顶点数p和带宽B,求满足最大度不超过B的连通图的最小边数,本文给出了一些f(p,B)的值及相应极图。 相似文献
67.
Alfonso Carriazo Luis M. Ferná ndez 《Proceedings of the American Mathematical Society》2004,132(11):3327-3336
In this paper we present an interesting relationship between graph theory and differential geometry by defining submanifolds of almost Hermitian manifolds associated with certain kinds of graphs. We show some results about the possibility of a graph being associated with a submanifold and we use them to characterize CR-submanifolds by means of trees. Finally, we characterize submanifolds associated with graphs in a four-dimensional almost Hermitian manifold.
68.
Kyu Hwang Yeon Suk Seong Kim Chung In Um Thomas F. George 《International Journal of Theoretical Physics》2003,42(9):2043-2059
Quantum Hamiltonian systems corresponding to classical systems related by a general canonical transformation are considered. The differential equation to find the unitary operator, which corresponds to the canonical transformation and connects quantum states of the original and transformed systems, is obtained. The propagator associated with their wave functions is found by the unitary operator. Quantum systems related by a linear canonical point transformation are analyzed. The results are tested by finding the wave functions of the under-, critical-, and over-damped harmonic oscillator from the wave functions of the harmonic oscillator, free-particle system, and negative harmonic potential system, using the unitary operator to connect them, respectively. 相似文献
69.
70.
林诒勋 《高校应用数学学报(英文版)》2003,18(3):361-369
§ 1 IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th… 相似文献