全文获取类型
收费全文 | 3340篇 |
免费 | 180篇 |
国内免费 | 178篇 |
专业分类
化学 | 269篇 |
晶体学 | 3篇 |
力学 | 27篇 |
综合类 | 30篇 |
数学 | 2947篇 |
物理学 | 422篇 |
出版年
2024年 | 11篇 |
2023年 | 66篇 |
2022年 | 85篇 |
2021年 | 61篇 |
2020年 | 126篇 |
2019年 | 121篇 |
2018年 | 115篇 |
2017年 | 93篇 |
2016年 | 89篇 |
2015年 | 73篇 |
2014年 | 135篇 |
2013年 | 290篇 |
2012年 | 119篇 |
2011年 | 178篇 |
2010年 | 190篇 |
2009年 | 302篇 |
2008年 | 249篇 |
2007年 | 194篇 |
2006年 | 180篇 |
2005年 | 135篇 |
2004年 | 116篇 |
2003年 | 113篇 |
2002年 | 90篇 |
2001年 | 79篇 |
2000年 | 72篇 |
1999年 | 68篇 |
1998年 | 73篇 |
1997年 | 53篇 |
1996年 | 42篇 |
1995年 | 20篇 |
1994年 | 22篇 |
1993年 | 16篇 |
1992年 | 16篇 |
1991年 | 10篇 |
1990年 | 15篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 5篇 |
1985年 | 13篇 |
1984年 | 13篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3698条查询结果,搜索用时 171 毫秒
991.
The nullity of a graph G is defined to be the multiplicity of the eigenvalue zero in its spectrum. In this paper we characterize the unicyclic graphs with nullity one in aspect of its graphical construction. 相似文献
992.
In this work we show that, for any fixed d, random d-regular graphs asymptotically almost surely can be coloured with k colours, where k is the smallest integer satisfying d<2(k−1)log(k−1). From previous lower bounds due to Molloy and Reed, this establishes the chromatic number to be asymptotically almost surely k−1 or k. If moreover d>(2k−3)log(k−1), then the value k−1 is discarded and thus the chromatic number is exactly determined. Hence we improve a recently announced result by Achlioptas and Moore in which the chromatic number was allowed to take the value k+1. Our proof applies the small subgraph conditioning method to the number of equitable k-colourings, where a colouring is equitable if the number of vertices of each colour is equal. 相似文献
993.
Zhilong Li 《Nonlinear Analysis: Theory, Methods & Applications》2010,72(6):3216-3221
In this paper, we consider the Neumann boundary value problem
994.
Given a graph G=(V, E), let ${\mathcal{P}}$ be a partition of V. We say that ${\mathcal{P}}$ is dominating if, for each part P of ${\mathcal{P}}$, the set V\P is a dominating set in G (equivalently, if every vertex has a neighbor of a different part from its own). We say that ${\mathcal{P}}$ is acyclic if for any parts P, P′ of ${\mathcal{P}}$, the bipartite subgraph G[P, P′] consisting of the edges between P and P′ in ${\mathcal{P}}$ contains no cycles. The acyclic dominating number ad(G) of G is the least number of parts in any partition of V that is both acyclic and dominating; and we shall denote by ad(d) the maximum over all graphs G of maximum degree at most d of ad(G). In this article, we prove that ad(3)=2, which establishes a conjecture of P. Boiron, É. Sopena, and L. Vignal, DIMACS/DIMATIA Conference “Contemporary Trends in Discrete Mathematics”, 1997, pp. 1–10. For general d, we prove the upper bound ad(d)=O(dlnd) and a lower bound of ad(d)=Ω(d). © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 292–311, 2010 相似文献
995.
程郁琨 《数学的实践与认识》2010,40(19)
顾客为子树结构的树上反中心选址问题是在树T上寻找一点(位于顶点处或在边的内部),使得该点与子树结构的顾客之间的最小赋权带加数距离尽可能地大.给出了该问题的一个有效算法,其时间复杂度为O(cn+sum from j=1 to m n_j),其中n_j为各子树T_j的顶点个数,c为不同的子树权重个数,n为树的顶点数. 相似文献
996.
图G的一个k-正常着色满足相邻的点所关联的边的色集合不同,且任两色的边数之差不超过1称为G的k-邻强均匀边染色,图G邻强均匀边染色中最小的k称为图G的邻强均匀边色数.本文得到了P_m×P_n的邻强均匀边色数. 相似文献
997.
We derive the expressions of the ordinary, the vertex‐weighted and the doubly vertex‐weighted Wiener polynomials of a type of thorn graph, for which the number of pendant edges attached to any vertex of the underlying parent graph is a linear function of its degree. We also define variable vertex‐weighted Wiener polynomials and calculate them for the same type of thorn graphs. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
998.
《Journal of Graph Theory》2018,88(1):146-153
For minimally k‐connected graphs on n vertices, Mader proved a tight lower bound for the number of vertices of degree k in dependence on n and k. Oxley observed 1981 that in many cases a considerably better bound can be given if is used as additional parameter, i.e. in dependence on m, n, and k. It was left open to determine whether Oxley's more general bound is best possible. We show that this is not the case, but give a closely related bound that deviates from a variant of Oxley's long‐standing one only for small values of m. We prove that this new bound is best possible. The bound contains Mader's bound as special case. 相似文献
999.
《Random Structures and Algorithms》2018,52(3):379-418
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or susceptible. At each round every susceptible vertex which has at least infected neighbours becomes infected and remains so forever. Assume that initially vertices are randomly infected, where is the total number of vertices of the graph. Suppose also that , where is the average degree. We determine a critical function such that when , complete infection occurs with high probability as , but when , then with high probability the process evolves only for a bounded number of rounds and the final set of infected vertices is asymptotically equal to . 相似文献
1000.
《Random Structures and Algorithms》2018,52(3):367-378
We introduce a new procedure for generating the binomial random graph/hypergraph models, referred to as online sprinkling. As an illustrative application of this method, we show that for any fixed integer , the binomial ‐uniform random hypergraph contains edge‐disjoint perfect matchings, provided , where is an integer depending only on . Our result for is asymptotically optimal and for is optimal up to the factor. This significantly improves a result of Frieze and Krivelevich. 相似文献