全文获取类型
收费全文 | 8406篇 |
免费 | 889篇 |
国内免费 | 528篇 |
专业分类
化学 | 521篇 |
晶体学 | 20篇 |
力学 | 319篇 |
综合类 | 227篇 |
数学 | 7215篇 |
物理学 | 1521篇 |
出版年
2024年 | 28篇 |
2023年 | 132篇 |
2022年 | 276篇 |
2021年 | 236篇 |
2020年 | 274篇 |
2019年 | 302篇 |
2018年 | 301篇 |
2017年 | 329篇 |
2016年 | 252篇 |
2015年 | 196篇 |
2014年 | 363篇 |
2013年 | 644篇 |
2012年 | 320篇 |
2011年 | 466篇 |
2010年 | 455篇 |
2009年 | 617篇 |
2008年 | 583篇 |
2007年 | 464篇 |
2006年 | 472篇 |
2005年 | 400篇 |
2004年 | 327篇 |
2003年 | 301篇 |
2002年 | 276篇 |
2001年 | 264篇 |
2000年 | 234篇 |
1999年 | 212篇 |
1998年 | 185篇 |
1997年 | 150篇 |
1996年 | 105篇 |
1995年 | 100篇 |
1994年 | 84篇 |
1993年 | 59篇 |
1992年 | 46篇 |
1991年 | 44篇 |
1990年 | 32篇 |
1989年 | 32篇 |
1988年 | 35篇 |
1987年 | 24篇 |
1986年 | 17篇 |
1985年 | 31篇 |
1984年 | 37篇 |
1983年 | 9篇 |
1982年 | 20篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 16篇 |
1978年 | 12篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 8篇 |
排序方式: 共有9823条查询结果,搜索用时 15 毫秒
991.
本文对带宽等于最小度的图的边数极值问题进行了研究,主要结果如下:对任意给定的正整数n及r(r相似文献
992.
对于图G(或有向图D)内的任意两点u和v,u—v测地线是指在u和v之间(或从u到v)的最短路.I(u,v)表示位于u—v测地线上所有点的集合,对于S(?)V(G)(或V(D)),I(S)表示所有I(u,v)的并,这里u,v∈S.G(或D)的测地数g(G)(或g(D))是使I(S)=V(G)(或I(S)=V(D))的点集S的最小基数.G的下测地数g~-(G)=min{g(D):D是G的定向图},G的上测地数g~ (G)=max{g(D):D是G的定向图}.对于u∈V(G)和v∈V(H),G_u H_v表示在u和v之间加一条边所得的图.本文主要研究图G_u H_v的测地数和上(下)测地数. 相似文献
993.
Fuji Zhang 《Discrete Mathematics》2006,306(13):1415-1423
A graph G is said to be bicritical if G-u-v has a perfect matching for every choice of a pair of points u and v. Bicritical graphs play a central role in decomposition theory of elementary graphs with respect to perfect matchings. As Plummer pointed out many times, the structure of bicritical graphs is far from completely understood. This paper presents a concise structure characterization on bicritical graphs in terms of factor-critical graphs and transversals of hypergraphs. A connected graph G with at least 2k+2 points is said to be k-extendable if it contains a matching of k lines and every such matching is contained in a perfect matching. A structure characterization for k-extendable bipartite graphs is given in a recursive way. Furthermore, this paper presents an O(mn) algorithm for determining the extendability of a bipartite graph G, the maximum integer k such that G is k-extendable, where n is the number of points and m is the number of lines in G. 相似文献
994.
WANG Yingqian Department of Mathematics Zhejiang Normal University Jinhua China 《中国科学A辑(英文版)》2006,49(6):791-799
The third edge-connectivity λ3(G) of a graph G is defined as the minimum cardinality over all sets of edges, if any, whose deletion disconnects G and each component of the resulting graph has at least 3 vertices. An upper bound has been established for λ3(G) whenever λ3(G) is well-defined. This paper first introduces two combinatorial optimization concepts, that is, maximality and superiority, of λ3(G), and then proves the Ore type sufficient conditions for G to be maximally and super third edge-connected. These concepts and results are useful in network reliability analysis. 相似文献
995.
996.
By establishing the connection between graph colouring and the solution of some equation systems in finite fields, we obtain some formulas to the number of solutions of some equation systems in finite fields, in terms of chromatic polynomial of a graph. 相似文献
997.
We prove that there is a Poincaré type duality in E-theory between higher rank graph algebras associated with a higher rank graph and its opposite correspondent. We obtain an
r-duality, that is the fundamental classes are in Er. The basic tools are a higher rank Fock space and higher rank Toeplitz algebra which has a more interesting ideal structure
than in the rank 1 case. The K-homology fundamental class is given by an r-fold exact sequence whereas the K-theory fundamental class is given by a homomorphism. The E-theoretic products are essentially pull-backs so that the computation is done at the level of exact sequences.
Mathematics Subject Classification (2000): 46L80. 相似文献
998.
Yuichiro Fujiwara 《Discrete Mathematics》2007,307(13):1551-1558
A Steiner 2-design S(2,k,v) is said to be halvable if the block set can be partitioned into two isomorphic sets. This is equivalent to an edge-disjoint decomposition of a self-complementary graph G on v vertices into Kks. The obvious necessary condition of those orders v for which there exists a halvable S(2,k,v) is that v admits the existence of an S(2,k,v) with an even number of blocks. In this paper, we give an asymptotic solution for various block sizes. We prove that for any k?5 or any Mersenne prime k, there is a constant number v0 such that if v>v0 and v satisfies the above necessary condition, then there exists a halvable S(2,k,v). We also show that a halvable S(2,2n,v) exists for over a half of possible orders. Some recursive constructions generating infinitely many new halvable Steiner 2-designs are also presented. 相似文献
999.
By Petersen's theorem, a bridgeless cubic multigraph has a 2-factor. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing that every such multigraph has a spanning even subgraph. Our main result is that every bridgeless simple graph with minimum degree at least three has a spanning even subgraph in which every component has at least four vertices. We deduce that if G is a simple bridgeless graph with n vertices and minimum degree at least three, then its line graph has a 2-factor with at most max{1,(3n-4)/10} components. This upper bound is best possible. 相似文献
1000.
Ladislav Nebeský 《Discrete Mathematics》2007,307(16):2067-2073
Let V be a finite nonempty set. In this paper, a road system on V (as a generalization of the set of all geodesics in a connected graph G with V(G)=V) and an intervaloid function on V (as a generalization of the interval function (in the sense of Mulder) of a connected graph G with V(G)=V) are introduced. A natural bijection of the set of all intervaloid functions on V onto the set of all road systems on V is constructed. This bijection enables to deduce an axiomatic characterization of the interval function of a connected graph G from a characterization of the set of all geodesics in G. 相似文献