全文获取类型
收费全文 | 1549篇 |
免费 | 22篇 |
国内免费 | 75篇 |
专业分类
化学 | 89篇 |
晶体学 | 1篇 |
力学 | 10篇 |
综合类 | 5篇 |
数学 | 1472篇 |
物理学 | 69篇 |
出版年
2023年 | 34篇 |
2022年 | 32篇 |
2021年 | 25篇 |
2020年 | 40篇 |
2019年 | 70篇 |
2018年 | 40篇 |
2017年 | 31篇 |
2016年 | 13篇 |
2015年 | 20篇 |
2014年 | 41篇 |
2013年 | 139篇 |
2012年 | 37篇 |
2011年 | 103篇 |
2010年 | 101篇 |
2009年 | 154篇 |
2008年 | 152篇 |
2007年 | 97篇 |
2006年 | 88篇 |
2005年 | 39篇 |
2004年 | 43篇 |
2003年 | 50篇 |
2002年 | 37篇 |
2001年 | 32篇 |
2000年 | 29篇 |
1999年 | 22篇 |
1998年 | 28篇 |
1997年 | 17篇 |
1996年 | 18篇 |
1995年 | 14篇 |
1994年 | 9篇 |
1993年 | 9篇 |
1992年 | 10篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 12篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有1646条查询结果,搜索用时 31 毫秒
21.
In this paper we define the vertex-cover polynomial Ψ(G,τ) for a graph G. The coefficient of τr in this polynomial is the number of vertex covers V′ of G with |V′|=r. We develop a method to calculate Ψ(G,τ). Motivated by a problem in biological systematics, we also consider the mappings f from {1, 2,…,m} into the vertex set V(G) of a graph G, subject to f−1(x)f−1(y)≠ for every edge xy in G. Let F(G,m) be the number of such mappings f. We show that F(G,m) can be determined from Ψ(G,τ). 相似文献
22.
Claire Cates Haulk John Drew Charles R. Johnson J. Hunter Tart 《Linear and Multilinear Algebra》1997,43(1):35-51
For a given n-by-n matrix A, we consider the set of matrices which commute with A and all of whose principal submatrices commute with the corresponding principal submatrices of A. The properties of this set are examined, with particular attention to its dimension. 相似文献
23.
设k是一个正整数,G是一个顶点数为|G|=4k的图. 假设σ\-2(G)≥4k-1, 则G有一个支撑子图含k-1个4圈和一条顶点数为4的路,使得所有这些圈和路都是相互独立的. 设G=(V\-1,V \-2;E)是一个二分图使得|V\-1|=|V\-2|=2k. 如果对G中每一对满足x∈V\-1和y∈V\-2的不 相邻的顶点x和y 都有d(x)+d(y)≥2k+1, 则G包含k-1个相互独立的4圈和一条顶点数为4的路,使得所有这些圈和路都是相互独立的,并且此度条件是最好的. 相似文献
24.
Jochen Alber Jií Fiala 《Journal of Algorithms in Cognition, Informatics and Logic》2004,52(2):134-151
We consider the parameterized problem, whether for a given set
of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time
that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time
. The results are based on problem kernelization and a new “geometric (
-separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.” 相似文献
25.
关于k—消去图的若干新结果 总被引:2,自引:0,他引:2
汪长平 《数学物理学报(A辑)》1998,18(3):302-309
设G是一个图.k是自然数.图G的一个k-正则支撑子图称为G的一个k-因子.若对于G的每条边e.G—e都存在一个k-因子,则称G是一个k-消去图.该文得到了一个图是k-消去图的若干充分条件,推广了文[2—4]中有关结论. 相似文献
26.
27.
Let G be a graph and f : V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph if degH(x){1,3,…,f(x)} for all xV(H). If f(x)=1 for all xV(G), then a (1,f)-odd subgraph is nothing but a matching. A (1,f)-odd subgraph H of G is said to be maximum if G has no (1,f)-odd subgraph K such that |K|>|H|. We show that (1,f)-odd subgraphs have some properties similar to those of matchings, in particular, we give a formula for the order of a maximum (1,f)-odd subgraph, which is similar to that for the order of a maximum matching. 相似文献
28.
Dekel Tsur 《Discrete Applied Mathematics》2007,155(10):1275-1293
We study the following problem: given a tree G and a finite set of trees H, find a subset O of the edges of G such that G-O does not contain a subtree isomorphic to a tree from H, and O has minimum cardinality. We give sharp boundaries on the tractability of this problem: the problem is polynomial when all the trees in H have diameter at most 5, while it is NP-hard when all the trees in H have diameter at most 6. We also show that the problem is polynomial when every tree in H has at most one vertex with degree more than 2, while it is NP-hard when the trees in H can have two such vertices.The polynomial-time algorithms use a variation of a known technique for solving graph problems. While the standard technique is based on defining an equivalence relation on graphs, we define a quasiorder. This new variation might be useful for giving more efficient algorithm for other graph problems. 相似文献
29.
Daniel Král’ Jan Kratochvíl Andrzej Proskurowski Heinz-Jürgen Voss 《Discrete Applied Mathematics》2006,154(4):660-672
A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases. 相似文献
30.
Summary The method for the contraction and expansion of graphs is used to treat the subspectrality of benzenoid hydrocarbons in relation to eigenvalues ±1. Counts of benzenoid hydrocarbons together with degeneracies of eigenvalues have been carried out for all species having h 7 hexagons. In addition, twelve homologous series are evaluated, and the closed results for the distribution of eigenvalues ± 1 and degeneracies in terms of the number of repeated units are tabulated. This method is universal and applicable to cases sharing other eigenvalues and to nonbenzenoid systems.Also known as Yuan-sun Kiang 相似文献