全文获取类型
收费全文 | 7674篇 |
免费 | 712篇 |
国内免费 | 609篇 |
专业分类
化学 | 608篇 |
晶体学 | 5篇 |
力学 | 155篇 |
综合类 | 201篇 |
数学 | 7376篇 |
物理学 | 650篇 |
出版年
2024年 | 19篇 |
2023年 | 124篇 |
2022年 | 182篇 |
2021年 | 162篇 |
2020年 | 257篇 |
2019年 | 277篇 |
2018年 | 279篇 |
2017年 | 274篇 |
2016年 | 191篇 |
2015年 | 169篇 |
2014年 | 262篇 |
2013年 | 670篇 |
2012年 | 292篇 |
2011年 | 401篇 |
2010年 | 405篇 |
2009年 | 562篇 |
2008年 | 523篇 |
2007年 | 408篇 |
2006年 | 473篇 |
2005年 | 354篇 |
2004年 | 322篇 |
2003年 | 293篇 |
2002年 | 290篇 |
2001年 | 259篇 |
2000年 | 252篇 |
1999年 | 231篇 |
1998年 | 194篇 |
1997年 | 142篇 |
1996年 | 108篇 |
1995年 | 81篇 |
1994年 | 76篇 |
1993年 | 53篇 |
1992年 | 39篇 |
1991年 | 32篇 |
1990年 | 22篇 |
1989年 | 29篇 |
1988年 | 21篇 |
1987年 | 17篇 |
1985年 | 31篇 |
1984年 | 26篇 |
1983年 | 14篇 |
1982年 | 29篇 |
1981年 | 12篇 |
1980年 | 16篇 |
1979年 | 13篇 |
1977年 | 24篇 |
1976年 | 14篇 |
1975年 | 15篇 |
1974年 | 14篇 |
1973年 | 19篇 |
排序方式: 共有8995条查询结果,搜索用时 15 毫秒
121.
Let G = (V,E) be a graph or digraph and r : V → Z+. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν1,…,νr(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003 相似文献
122.
For each infinite cardinal κ, we give examples of 2κ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003 相似文献
123.
124.
面对多样化的市场需求,企业的销售渠道也变得异常复杂,利用网络图可以简化实际问题,并能形象地描述它。本根据网络知识建立了产品分销模型,探求企业在市场需求固定和随机时的最优收益。最后,章还进行实例验算,并做出相应的结果分析。 相似文献
125.
Richard Arratia Bla Bollobs Gregory B. Sorkin 《Journal of Combinatorial Theory, Series B》2004,92(2):199-233
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers. 相似文献
126.
127.
G. Sreenivasulu Reddy J. Hanumanthachari T. Vasanthi 《Southeast Asian Bulletin of Mathematics》2003,26(2):331-335
This paper is mainly dealt with the structure of totally ordered rings (t.o. rings) whose positive cones are finitely generated as multiplicative right ideals.AMS Subject Classification (1991): 16W80, 13J25 相似文献
128.
129.
Michel Vasquez 《Journal of Heuristics》2004,10(4):407-413
For the Queens_n
2 graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14. 相似文献
130.
本文在Q-正则Loewner空间中用环模不等式刻划了拟对称映射.另外,在 Q-维Ahlfors-David正则空间中建立了拟对称映射作用下的Grotzsch-Teichmuller型 模不等式,它是通过伸张系数的积分平均来表示. 相似文献