全文获取类型
收费全文 | 5560篇 |
免费 | 416篇 |
国内免费 | 343篇 |
专业分类
化学 | 233篇 |
晶体学 | 2篇 |
力学 | 31篇 |
综合类 | 139篇 |
数学 | 5553篇 |
物理学 | 361篇 |
出版年
2024年 | 23篇 |
2023年 | 101篇 |
2022年 | 175篇 |
2021年 | 136篇 |
2020年 | 207篇 |
2019年 | 233篇 |
2018年 | 225篇 |
2017年 | 205篇 |
2016年 | 132篇 |
2015年 | 92篇 |
2014年 | 206篇 |
2013年 | 495篇 |
2012年 | 202篇 |
2011年 | 319篇 |
2010年 | 319篇 |
2009年 | 460篇 |
2008年 | 412篇 |
2007年 | 293篇 |
2006年 | 322篇 |
2005年 | 226篇 |
2004年 | 206篇 |
2003年 | 173篇 |
2002年 | 170篇 |
2001年 | 156篇 |
2000年 | 145篇 |
1999年 | 148篇 |
1998年 | 123篇 |
1997年 | 79篇 |
1996年 | 55篇 |
1995年 | 53篇 |
1994年 | 42篇 |
1993年 | 29篇 |
1992年 | 27篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 15篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6319条查询结果,搜索用时 15 毫秒
71.
《Discrete Mathematics》2022,345(3):112721
This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates. 相似文献
72.
《Discrete Mathematics》2022,345(5):112797
If the line graph of a graph G decomposes into Hamiltonian cycles, what is G? We answer this question for decomposition into two cycles. 相似文献
73.
《Discrete Mathematics》2022,345(6):112832
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance. 相似文献
74.
《Discrete Mathematics》2022,345(9):112954
One of the remarkable contributions in the study of symmetric Cayley graphs on nonabelian simple groups is the complete classification of such graphs that are cubic and nonnormal. This naturally motivates the study of cubic (normal and nonnormal) symmetric bi-Cayley graphs on nonabelian simple groups. In this paper, the full automorphism groups of these graphs are determined, and necessary and sufficient conditions are given for a graph being a cubic normal symmetric Cayley or bi-Cayley graph on a nonabelian simple group (one may then find many examples). As an application, we also prove that cubic symmetric Cayley graphs on nonabelian simple groups are stable. 相似文献
75.
《Discrete Mathematics》2022,345(10):113028
We prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs. 相似文献
76.
77.
设$ G $ 是一个$ n $ 阶$ k $ 圈图, $ k $ 圈图为边数等于顶点数加$ k-1 $ 的简单连通图。$ \mu_{1}(G) $ 、$ \mu_{2}(G) $ 分别记为图$ G $ 的Laplace矩阵的最大特征值和次大特征值, 图$ G $ 的Laplace分离度定义为$ S_{L}(G)=\mu_{1}(G)-\mu_{2}(G) $ 。本文研究了给定阶数的$ k $ 圈图的最大Laplace分离度, 并刻画了相应的极图, 其结果推广了已有当$ k=1, 2, 3 $ 时的结论。 相似文献
78.
We introduce an impartial combinatorial game on Steiner triple systems called Next One to Fill Is the Loser (Nofil ). Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. By computing nim-values, we determine optimal strategies for Nofil on all Steiner triple systems up to order 15 and a sampling for orders 19, 21 and 25. The game Nofil can be thought of in terms of play on a corresponding hypergraph which will become a graph during play. At that point Nofil is equivalent to playing the game Node Kayles on the graph. We prove necessary conditions and sufficient conditions for a graph to reached playing Nofil. We conclude that the complexity of determining the outcome of the game Nofil on Steiner triple systems is PSPACE-complete for randomized reductions. 相似文献
79.
On bandwidth sums of graphs 总被引:1,自引:0,他引:1
ONBANDWIDTHSUMSOFGRAPHSYAOBING(姚兵);WANGJIANFANG(王建方)(DepartmentofMathematics,NorihwesteternNormalUniversity,Lanzhou730070,Chi... 相似文献
80.
Michael Sturgeon 《Annals of the Institute of Statistical Mathematics》1996,48(4):675-686
f(x) is a univariate density in C
4 with bounded support. For any n and sufficiently small kernel bandwidths, the symmetric appendage of any negative mass, –U, to any smooth unimodal symmetric kernel of order p=2 shifts expected estimator mass from regions where f(x)>0 to regions where f(x)<0. For large n, the mean automatic kernel adaptation induced by –U is analyzed in the simplest MISE reduction scenario: The symmetric appendage of –U to the uniform kernel K(x, X) over MISE-optimal bandwidths reduces MISE by shifting K(x, X) mass asymmetrically across the observation X in the direction of decreasing |f(x)|. 相似文献