全文获取类型
收费全文 | 727篇 |
免费 | 88篇 |
国内免费 | 59篇 |
专业分类
化学 | 69篇 |
晶体学 | 17篇 |
力学 | 76篇 |
综合类 | 21篇 |
数学 | 467篇 |
物理学 | 224篇 |
出版年
2024年 | 2篇 |
2023年 | 12篇 |
2022年 | 16篇 |
2021年 | 15篇 |
2020年 | 20篇 |
2019年 | 24篇 |
2018年 | 20篇 |
2017年 | 19篇 |
2016年 | 27篇 |
2015年 | 20篇 |
2014年 | 23篇 |
2013年 | 64篇 |
2012年 | 28篇 |
2011年 | 33篇 |
2010年 | 21篇 |
2009年 | 27篇 |
2008年 | 44篇 |
2007年 | 55篇 |
2006年 | 50篇 |
2005年 | 39篇 |
2004年 | 37篇 |
2003年 | 44篇 |
2002年 | 37篇 |
2001年 | 23篇 |
2000年 | 29篇 |
1999年 | 36篇 |
1998年 | 27篇 |
1997年 | 17篇 |
1996年 | 16篇 |
1995年 | 9篇 |
1994年 | 6篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 6篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1980年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有874条查询结果,搜索用时 15 毫秒
1.
2.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献
3.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
4.
Krzysztof Pawaowski 《K-Theory》1998,13(1):41-55
The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery. 相似文献
5.
王军秀 《纯粹数学与应用数学》2007,23(3):406-408
利用欧拉公式研究了Gdk图的平面性,获得了一个重要定理,并由此得到了关于平面图色数的一个结论. 相似文献
6.
E. Alper Yildirim Xiaofei Fan-Orzechowski 《Computational Optimization and Applications》2006,33(2-3):229-247
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions
of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph
to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable
set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite
formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex
that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure
is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly
rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start
strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently
extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality.
This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author
was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA. 相似文献
7.
A self-consistent system of gravitational field with a binary mixture of perfect fluid and dark energy given by a cosmological
constant has been considered in Bianchi Type-V universe. The perfect fluid is chosen to be obeying either the equation of
state p=γρ with γ ε |0,1| or a van der Waals equation of state. The role of A-term in the evolution of the Bianchi Type-V universe has been
studied. 相似文献
8.
《Operations Research Letters》2022,50(4):407-414
In this study, the existing game theoretical framework is extended to strategic queuing in search of solutions for a two-population game in observable double-ended queuing systems with zero matching times. We show that multiple Nash equilibria and one unique subgame perfect Nash equilibrium exist in this game. 相似文献
9.
For lattices with two kinds of points (black and white), distributed according to a translation-invariant joint probability distribution, we study statistical properties of the sequence of consecutive colors encountered by a random walker moving through the lattice. The probability distribution for the single steps of the walk is considered to be independent of the colors of the points. Several exact results are presented which are valid in any number of dimensions and for arbitrary probability distributions for the coloring of the points and the steps of the walk. They are used to derive a few general properties of random walks on lattices containing traps.Presented at the Symposium on Random Walks, Gaithersburg, MD, June 1982. 相似文献
10.
F. Thuijsman S. H. Tijs O. J. Vrieze 《Journal of Optimization Theory and Applications》1991,69(2):311-324
We examine stochastic games with finite state and action spaces. For the -discounted case, as well as for the irreducible limiting average case, we show the existence of trembling-hand perfect equilibria and give characterizations of those equilibria. In the final section, we give an example which illustrates that the existence of stationary limiting average equilibria in a nonirreducible stochastic game does not imply the existence of a perfect limiting average equilibrium.Support was provided by the Netherlands Organization for Scientific Research NWO via the Netherlands Foundation for Mathematics SMC, Project 10-64-10. 相似文献