全文获取类型
收费全文 | 3138篇 |
免费 | 166篇 |
国内免费 | 118篇 |
专业分类
化学 | 91篇 |
晶体学 | 1篇 |
力学 | 9篇 |
综合类 | 29篇 |
数学 | 3114篇 |
物理学 | 178篇 |
出版年
2024年 | 12篇 |
2023年 | 57篇 |
2022年 | 86篇 |
2021年 | 66篇 |
2020年 | 115篇 |
2019年 | 112篇 |
2018年 | 99篇 |
2017年 | 95篇 |
2016年 | 65篇 |
2015年 | 64篇 |
2014年 | 113篇 |
2013年 | 316篇 |
2012年 | 86篇 |
2011年 | 174篇 |
2010年 | 169篇 |
2009年 | 286篇 |
2008年 | 238篇 |
2007年 | 186篇 |
2006年 | 179篇 |
2005年 | 102篇 |
2004年 | 107篇 |
2003年 | 106篇 |
2002年 | 82篇 |
2001年 | 67篇 |
2000年 | 65篇 |
1999年 | 68篇 |
1998年 | 68篇 |
1997年 | 54篇 |
1996年 | 33篇 |
1995年 | 11篇 |
1994年 | 19篇 |
1993年 | 19篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 12篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有3422条查询结果,搜索用时 15 毫秒
81.
Let G be a connected regular graph. Denoted by t(G) and Kf(G) the total graph and Kirchhoff index of G, respectively. This paper is to point out that Theorem 3.7 and Corollary 3.8 from “Kirchhoff index in line, subdivision and total graphs of a regular graph” [X. Gao, Y.F. Luo, W.W. Liu, Kirchhoff index in line, subdivision and total graphs of a regular graph, Discrete Appl. Math. 160(2012) 560–565] are incorrect, since the conclusion of a lemma is essentially wrong. Moreover, we first show the Laplacian characteristic polynomial of t(G), where G is a regular graph. Consequently, by using Kf(G), we give an expression on Kf(t(G)) and a lower bound on Kf(t(G)) of a regular graph G, which correct Theorem 3.7 and Corollary 3.8 in Gao et al. (2012) [2]. 相似文献
82.
四元数矩阵理论中的几个概念间的关系 总被引:17,自引:0,他引:17
本文指出并改正文[1]中的错误,给出弱特征多项式[2]与重特征多项式[3]间的显式关系,同时也给出行列式[2]与重行列式[4]间的显式关系,最后讨论了左特征值、右特征值、特征值和特征根之间的关系及最小多项式与弱特征多项式根之间的关系. 相似文献
83.
The effect of a market factor on information flow between stocks using the minimal spanning tree 总被引:1,自引:0,他引:1
We empirically investigated the effects of market factors on the information flow created from N(N−1)/2 linkage relationships among stocks. We also examined the possibility of employing the minimal spanning tree (MST) method, which is capable of reducing the number of links to N−1. We determined that market factors carry important information value regarding information flow among stocks. Moreover, the information flow among stocks showed time-varying properties according to the changes in market status. In particular, we noted that the information flow increased dramatically during periods of market crises. Finally, we confirmed, via the MST method, that the information flow among stocks could be assessed effectively with the reduced linkage relationships among all links among stocks from the perspective of the overall market. 相似文献
84.
85.
On Clique-Transversals and Clique-Independent Sets 总被引:1,自引:0,他引:1
Guillermo Durán Min Chih Lin Jayme L. Szwarcfiter 《Annals of Operations Research》2002,116(1-4):71-77
A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. A clique-independent set is a subset of pairwise disjoint cliques of G. Denote by
C
(G) and
C
(G) the cardinalities of the minimum clique-transversal and maximum clique-independent set of G, respectively. Say that G is clique-perfect when
C
(H)=
C
(H), for every induced subgraph H of G. In this paper, we prove that every graph not containing a 4-wheel nor a 3-fan as induced subgraphs and such that every odd cycle of length greater than 3 has a short chord is clique-perfect. The proof leads to polynomial time algorithms for finding the parameters
C
(G) and
C
(G), for graphs belonging to this class. In addition, we prove that to decide whether or not a given subset of vertices of a graph is a clique-transversal is Co-NP-Complete. The complexity of this problem has been mentioned as unknown in the literature. Finally, we describe a family of highly clique-imperfect graphs, that is, a family of graphs G whose difference
C
(G)–
C
(G) is arbitrarily large. 相似文献
86.
Based on our analysis of the hopcount of the shortest path between two arbitrary nodes in the class G
p
(N) of random graphs, the corresponding flooding time is investigated. The flooding time T
N
(p) is the minimum time needed to reach all other nodes from one node. We show that, after scaling, the flooding time T
N
(p) converges in distribution to the two-fold convolution (2*) of the Gumbel distribution function (z)=exp (–e
–z
), when the link density p
N
satisfies Np
N
/(log N)3 if N . 相似文献
87.
Within the Feynman–Kac path integral representation, the equilibrium quantities of a quantum plasma can be represented by Mayer graphs. The well known Coulomb divergencies that appear in these series are eliminated by partial resummations. In this paper, we propose a resummation scheme based on the introduction of a single effective potential that is the quantum analog of the Debye potential. A low density analysis of shows that it reduces, at short distances, to the bare Coulomb interaction between the charges (which is able to lead to bound states). At scale of the order of the Debye screening length
–1
D, approaches the classical Debye potential and, at large distances, it decays as a dipolar potential (this large distance behaviour is due to the quantum nature of the particles). The prototype graphs that result from the resummation obey the same diagrammatical rules as the classical graphs of the Abe–Meeron series. We give several applications that show the usefulness of to account for Coulombic effects at all distances in a coherent way. 相似文献
88.
本文给出了一个图为Menger型的一个充分必要条件,利用这个条件,我们拓广了已知的Menger型图的类。 相似文献
89.
The accumulation of the Jacobian matrix F of a vector function can be regarded as a transformation of its linearized computational graph into a subgraph of the directed complete bipartite graph Kn,m. This transformation can be performed by applying different elimination techniques that may lead to varying costs for computing F. This paper introduces face elimination as the basic technique for accumulating Jacobian matrices by using a minimal number of arithmetic operations. Its superiority over both edge and vertex elimination methods is shown. The intention is to establish the conceptual basis for the ongoing development of algorithms for optimizing the computation of Jacobian matrices. 相似文献
90.
We solve a problem proposed by Jacobson, Kézdy, and Lehel [4] concerning the existence of forbidden induced subgraph characterizations of line graphs of linear k-uniform hypergraphs with sufficiently large minimal edge-degree. Actually, we prove that for each k3 there is a finite set Z(k) of graphs such that each graph G with minimum edge-degree at least 2k2–3k+1 is the line graph of a linear k-uniform hypergraph if and only if G is a Z(k)-free graph.Acknowledgments. We thank the anonymous referees, whose suggestions helped to improve the presentation of the paper.Winter 2002/2003 DIMACS Award is gratefully acknowledged2000 Mathematics Subject Classification: 05C65 (05C75, 05C85) 相似文献