全文获取类型
收费全文 | 5377篇 |
免费 | 424篇 |
国内免费 | 337篇 |
专业分类
化学 | 210篇 |
晶体学 | 2篇 |
力学 | 26篇 |
综合类 | 144篇 |
数学 | 5442篇 |
物理学 | 314篇 |
出版年
2024年 | 23篇 |
2023年 | 102篇 |
2022年 | 181篇 |
2021年 | 132篇 |
2020年 | 205篇 |
2019年 | 231篇 |
2018年 | 219篇 |
2017年 | 205篇 |
2016年 | 125篇 |
2015年 | 90篇 |
2014年 | 180篇 |
2013年 | 471篇 |
2012年 | 193篇 |
2011年 | 297篇 |
2010年 | 301篇 |
2009年 | 449篇 |
2008年 | 391篇 |
2007年 | 279篇 |
2006年 | 323篇 |
2005年 | 227篇 |
2004年 | 205篇 |
2003年 | 176篇 |
2002年 | 165篇 |
2001年 | 157篇 |
2000年 | 141篇 |
1999年 | 141篇 |
1998年 | 117篇 |
1997年 | 81篇 |
1996年 | 47篇 |
1995年 | 53篇 |
1994年 | 42篇 |
1993年 | 29篇 |
1992年 | 28篇 |
1991年 | 15篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 10篇 |
1986年 | 5篇 |
1985年 | 14篇 |
1984年 | 13篇 |
1983年 | 3篇 |
1982年 | 13篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6138条查询结果,搜索用时 78 毫秒
161.
《Discrete Mathematics》2022,345(12):113173
For a graph G, the unraveled ball of radius r centered at a vertex v is the ball of radius r centered at v in the universal cover of G. We obtain a lower bound on the weighted spectral radius of unraveled balls of fixed radius in a graph with positive weights on edges, which is used to present an upper bound on the (where ) smallest normalized Laplacian eigenvalue of irregular graphs under minor assumptions. Moreover, when , the result may be regarded as an Alon–Boppana type bound for a class of irregular graphs. 相似文献
162.
We construct a family of finite 2-groups which have commuting graph of increasing diameter. 相似文献
163.
Xiaofeng Xue 《随机分析与应用》2018,36(2):324-340
In this paper, we are concerned with a contact process with a semi-infected state on the complete graph Cn with n vertices. Our model is a special case of a general model introduced by Schinazi in 2003. In our model, each vertex is in one of three states, namely, “healthy,” “semi-infected,” or “fully-infected.” Only fully-infected vertices can infect others. A healthy vertex becomes semi-infected when being infected while a semi-infected vertex becomes fully-infected when being further infected. Each (semi- and fully-) infected vertex becomes healthy at constant rate. Our main result shows a phase transition for the waiting time until extinction of the fully-infected vertices. Conditioned on all the vertices are fully-infected when t = 0, we show that fully-infected vertices survive for exp?{O(n)} units of time when the infection rate λ > 4 while they die out in O(log?n) units of time when λ < 4. 相似文献
164.
In the context of massless quantum electrodynamics (QED) with a linear covariant gauge fixing, the connection between the counterterm and the Hopf-algebraic approach to renormalization is examined. The coproduct formula of Green’s functions contains two invariant charges, which give rise to different renormalization group functions. All formulas are tested by explicit computations to third loop order. The possibility of a finite electron self-energy by fixing a generalized linear covariant gauge is discussed. An analysis of subdivergences leads to the conclusion that such a gauge only exists in quenched QED. 相似文献
165.
XU ShangJin WU ZhengFei & DENG YunPing College of Mathematics Information Science Guangxi University Nanning 《中国科学A辑(英文版)》2009,(2)
A graph is said to be s-arc-regular if its full automorphism group acts regularly on the set of its s-arcs. In this paper, we investigate connected cubic s-arc-regular Cayley graphs of finite nonabelian simple groups. Two suffcient and necessary conditions for such graphs to be 1- or 2-arc-regular are given and based on the conditions, several infinite families of 1-or 2-arc-regular cubic Cayley graphs of alternating groups are constructed. 相似文献
166.
167.
Khodakhast Bibak 《International journal of quantum chemistry》2013,113(8):1209-1212
For a graph G, a “spanning tree” in G is a tree that has the same vertex set as G. The number of spanning trees in a graph (network) G, denoted by t(G), is an important invariant of the graph (network) with lots of decisive applications in many disciplines. In the article by Sato (Discrete Math. 2007, 307, 237), the number of spanning trees in an (r, s)‐semiregular graph and its line graph are obtained. In this article, we give short proofs for the formulas without using zeta functions. Furthermore, by applying the formula that enumerates the number of spanning trees in the line graph of an (r, s)‐semiregular graph, we give a new proof of Cayley's Theorem. © 2013 Wiley Periodicals, Inc. 相似文献
168.
Let (W,S) be a Coxeter system with a strictly complete Coxeter graph. The present paper concerns the set Red(z) of all reduced expressions for any z∈W. By associating each bc-expression to a certain symbol, we describe the set Red(z) and compute its cardinal |Red(z)| in terms of symbols. An explicit formula for |Red(z)| is deduced, where the Fibonacci numbers play a crucial role. 相似文献
169.
Gutman and Wagner proposed the concept of matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let G be a simple graph of order n and be the roots of its matching polynomial. The ME of G is defined to be the sum of the absolute values of . In this article, we characterize the graphs with minimal ME among all unicyclic and bicyclic graphs with a given diameter d. © 2014 Wiley Periodicals, Inc. Complexity 21: 224–238, 2015 相似文献
170.
Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs. 相似文献