全文获取类型
收费全文 | 1118篇 |
免费 | 55篇 |
国内免费 | 61篇 |
专业分类
化学 | 210篇 |
晶体学 | 3篇 |
力学 | 57篇 |
综合类 | 31篇 |
数学 | 591篇 |
物理学 | 342篇 |
出版年
2024年 | 4篇 |
2023年 | 17篇 |
2022年 | 27篇 |
2021年 | 22篇 |
2020年 | 41篇 |
2019年 | 40篇 |
2018年 | 31篇 |
2017年 | 26篇 |
2016年 | 32篇 |
2015年 | 31篇 |
2014年 | 54篇 |
2013年 | 96篇 |
2012年 | 46篇 |
2011年 | 63篇 |
2010年 | 64篇 |
2009年 | 94篇 |
2008年 | 98篇 |
2007年 | 75篇 |
2006年 | 56篇 |
2005年 | 55篇 |
2004年 | 40篇 |
2003年 | 40篇 |
2002年 | 24篇 |
2001年 | 17篇 |
2000年 | 21篇 |
1999年 | 21篇 |
1998年 | 25篇 |
1997年 | 10篇 |
1996年 | 9篇 |
1995年 | 7篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 10篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 1篇 |
排序方式: 共有1234条查询结果,搜索用时 12 毫秒
71.
Xuechao Li 《Graphs and Combinatorics》2006,22(4):503-513
In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of
Luo [6] and Y. Zhao [12]. 相似文献
72.
Hidefumi Ohsugi 《Journal of Combinatorial Theory, Series A》2006,113(4):718-725
Athanasiadis [Ehrhart polynomials, simplicial polytopes, magic squares and a conjecture of Stanley, J. Reine Angew. Math., to appear.] studies an effective technique to show that Gorenstein sequences coming from compressed polytopes are unimodal. In the present paper we will use such the technique to find a rich class of Gorenstein toric rings with unimodal h-vectors arising from finite graphs. 相似文献
73.
Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model. 相似文献
74.
75.
76.
极小Cayley图的限制性边连通度 总被引:1,自引:0,他引:1
一个连通图X的边集的一个子集C称为一个限制性边割,如果它是一个边割,且X/C不含孤立点。X的限制性边连通度λ′(X)定义为所有限制性边割的最小基数。本文完全决定了极小Cayley图的限制性边连通度。 相似文献
77.
For a non-zero real number α, let s α (G) denote the sum of the αth power of the non-zero Laplacian eigenvalues of a graph G. In this paper, we establish a connection between s α (G) and the first Zagreb index in which the Hölder’s inequality plays a key role. By using this result, we present a lot of bounds of s α (G) for a connected (molecular) graph G in terms of its number of vertices (atoms) and edges (bonds). We also present other two bounds for s α (G) in terms of connectivity and chromatic number respectively, which generalize those results of Zhou and Trinajsti? for the Kirchhoff index [B Zhou, N Trinajsti?. A note on Kirchhoff index, Chem. Phys. Lett., 2008, 455: 120–123]. 相似文献
78.
79.
Let A be a Hermitian matrix whose graph is G (i.e. there is an edge between the vertices i and j in G if and only if the (i,j) entry of A is non-zero). Let λ be an eigenvalue of A with multiplicity mA(λ). An edge e=ij is said to be Parter (resp., neutral, downer) for λ,A if mA(λ)−mA−e(λ) is negative (resp., 0, positive ), where A−e is the matrix resulting from making the (i,j) and (j,i) entries of A zero. For a tree T with adjacency matrix A a subset S of the edge set of G is called an edge star set for an eigenvalue λ of A, if |S|=mA(λ) and A−S has no eigenvalue λ. In this paper the existence of downer edges and edge star sets for non-zero eigenvalues of the adjacency matrix of a tree is proved. We prove that neutral edges always exist for eigenvalues of multiplicity more than 1. It is also proved that an edge e=uv is a downer edge for λ,A if and only if u and v are both downer vertices for λ,A; and e=uv is a neutral edge if u and v are neutral vertices. Among other results, it is shown that any edge star set for each eigenvalue of a tree is a matching. 相似文献
80.