全文获取类型
收费全文 | 6232篇 |
免费 | 558篇 |
国内免费 | 483篇 |
专业分类
化学 | 330篇 |
晶体学 | 4篇 |
力学 | 77篇 |
综合类 | 183篇 |
数学 | 6167篇 |
物理学 | 512篇 |
出版年
2024年 | 18篇 |
2023年 | 104篇 |
2022年 | 173篇 |
2021年 | 152篇 |
2020年 | 213篇 |
2019年 | 254篇 |
2018年 | 237篇 |
2017年 | 236篇 |
2016年 | 148篇 |
2015年 | 122篇 |
2014年 | 230篇 |
2013年 | 537篇 |
2012年 | 243篇 |
2011年 | 344篇 |
2010年 | 350篇 |
2009年 | 500篇 |
2008年 | 446篇 |
2007年 | 355篇 |
2006年 | 385篇 |
2005年 | 292篇 |
2004年 | 267篇 |
2003年 | 219篇 |
2002年 | 214篇 |
2001年 | 191篇 |
2000年 | 176篇 |
1999年 | 182篇 |
1998年 | 150篇 |
1997年 | 108篇 |
1996年 | 67篇 |
1995年 | 68篇 |
1994年 | 46篇 |
1993年 | 34篇 |
1992年 | 31篇 |
1991年 | 24篇 |
1990年 | 14篇 |
1989年 | 21篇 |
1988年 | 18篇 |
1987年 | 13篇 |
1986年 | 7篇 |
1985年 | 19篇 |
1984年 | 18篇 |
1983年 | 5篇 |
1982年 | 13篇 |
1981年 | 5篇 |
1980年 | 6篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
排序方式: 共有7273条查询结果,搜索用时 15 毫秒
991.
992.
993.
Let 𝒯(n,?r;?W n?1) be the set of all n-vertex weighted trees with r vertices of degree 2 and fixed positive weight set W n?1, 𝒫(n,?γ;?W n?1) the set of all n-vertex weighted trees with q pendants and fixed positive weight set W n?1, where W n?1?=?{w 1,?w 2,?…?,?w n?1} with w 1???w 2???···???w n?1?>?0. In this article, we first identify the unique weighted tree in 𝒯(n,?r;?W n?1) with the largest adjacency spectral radius. Then we characterize the unique weighted trees with the largest adjacency spectral radius in 𝒫(n,?γ;?W n?1). 相似文献
994.
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. The biclique graph of G, denoted by , is the intersection graph of the bicliques of G. We say that a graph G diverges (or converges or is periodic) under an operator F whenever ( for some m, or for some k and , respectively). Given a graph G, the iterated biclique graph of G, denoted by , is the graph obtained by applying the biclique operator k successive times to G. In this article, we study the iterated biclique graph of G. In particular, we classify the different behaviors of when the number of iterations k grows to infinity. That is, we prove that a graph either diverges or converges under the biclique operator. We give a forbidden structure characterization of convergent graphs, which yield a polynomial time algorithm to decide if a given graph diverges or converges. This is in sharp contrast with the situsation for the better known clique operator, where it is not even known if the corresponding problem is decidable. © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 181–190, 2013 相似文献
995.
Let be a plane graph with the sets of vertices, edges, and faces V, E, and F, respectively. If one can color all elements in using k colors so that any two adjacent or incident elements receive distinct colors, then G is said to be entirely k‐colorable. Kronk and Mitchem [Discrete Math 5 (1973) 253‐260] conjectured that every plane graph with maximum degree Δ is entirely ‐colorable. This conjecture has now been settled in Wang and Zhu (J Combin Theory Ser B 101 (2011) 490–501), where the authors asked: is every simple plane graph entirely ‐colorable? In this article, we prove that every simple plane graph with is entirely ‐colorable, and conjecture that every simple plane graph, except the tetrahedron, is entirely ‐colorable. 相似文献
996.
997.
Toshimasa Ishii 《Journal of Graph Theory》2013,74(4):392-416
Given an undirected graph and an integer , we consider the problem of augmenting G by a minimum set of new edges so that the diameter becomes at most D. It is known that no constant factor approximation algorithms to this problem with an arbitrary graph G can be obtained unless , while the problem with only a few graph classes such as forests is approximable within a constant factor. In this article, we give the first constant factor approximation algorithm to the problem with an outerplanar graph G. We also show that if the target diameter D is even, then the case where G is a partial 2‐tree is also approximable within a constant. 相似文献
998.
This paper studies the interactions between crane handling and truck transportation in a maritime container terminal by addressing them simultaneously. Yard trucks are shared among different ships, which helps to reduce empty truck trips in the terminal area. The problem is formulated as a constraint programming model and a three-stage algorithm is developed. At the first stage, crane schedules are generated by a heuristic method. At the second stage, the multiple-truck routing problem is solved based on the precedence relations of the transportation tasks derived from the first stage. At the last stage a complete solution is constructed by using a disjunctive graph. The three procedures are linked by an iterative structure, which facilitates the search for a good solution. The computational results indicate that the three-stage algorithm is effective for finding high-quality solutions and can efficiently solve large problems. 相似文献
999.
The star chromatic index of a graph G is the minimum number of colors needed to properly color the edges of the graph so that no path or cycle of length four is bi‐colored. We obtain a near‐linear upper bound in terms of the maximum degree . Our best lower bound on in terms of Δ is valid for complete graphs. We also consider the special case of cubic graphs, for which we show that the star chromatic index lies between 4 and 7 and characterize the graphs attaining the lower bound. The proofs involve a variety of notions from other branches of mathematics and may therefore be of certain independent interest. 相似文献
1000.
Consider the optimal dividend problem for an insurance company whose uncontrolled surplus precess evolves as a spectrally negative Levy process. We assume that dividends are paid to the shareholders according to admissible strategies whose dividend rate is bounded by a constant. The objective is to find a dividend policy so as to maximize the expected discounted value of dividends which are paid to the shareholders until the company is ruined. In this paper, we show that a threshold strategy (also called refraction strategy) forms an optimal strategy under the condition that the Levy measure has a completely monotone density. 相似文献