全文获取类型
收费全文 | 5377篇 |
免费 | 424篇 |
国内免费 | 337篇 |
专业分类
化学 | 210篇 |
晶体学 | 2篇 |
力学 | 26篇 |
综合类 | 144篇 |
数学 | 5442篇 |
物理学 | 314篇 |
出版年
2024年 | 23篇 |
2023年 | 102篇 |
2022年 | 181篇 |
2021年 | 132篇 |
2020年 | 205篇 |
2019年 | 231篇 |
2018年 | 219篇 |
2017年 | 205篇 |
2016年 | 125篇 |
2015年 | 90篇 |
2014年 | 180篇 |
2013年 | 471篇 |
2012年 | 193篇 |
2011年 | 297篇 |
2010年 | 301篇 |
2009年 | 449篇 |
2008年 | 391篇 |
2007年 | 279篇 |
2006年 | 323篇 |
2005年 | 227篇 |
2004年 | 205篇 |
2003年 | 176篇 |
2002年 | 165篇 |
2001年 | 157篇 |
2000年 | 141篇 |
1999年 | 141篇 |
1998年 | 117篇 |
1997年 | 81篇 |
1996年 | 47篇 |
1995年 | 53篇 |
1994年 | 42篇 |
1993年 | 29篇 |
1992年 | 28篇 |
1991年 | 15篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 10篇 |
1986年 | 5篇 |
1985年 | 14篇 |
1984年 | 13篇 |
1983年 | 3篇 |
1982年 | 13篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6138条查询结果,搜索用时 15 毫秒
111.
《Discrete Mathematics》2022,345(5):112806
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph G is the minimum difference between the largest and smallest labels in a sum graph consisting of G and the minimum number of additional isolated vertices necessary so that a sum graph labeling exists. We investigate the spum of various families of graphs, namely cycles, paths, and matchings. We introduce the sum-diameter, a modification of the definition of spum that omits the requirement that the number of additional isolated vertices in the sum graph is minimal, which we believe is a more natural quantity to study. We then provide asymptotically tight general bounds on both sides for the sum-diameter, and study its behavior under numerous binary graph operations as well as vertex and edge operations. Finally, we generalize the sum-diameter to hypergraphs. 相似文献
112.
《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. 相似文献
113.
《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. 相似文献
114.
《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. 相似文献
115.
116.
设$ 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 $ 时的结论。 相似文献
117.
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. 相似文献
118.
On bandwidth sums of graphs 总被引:1,自引:0,他引:1
ONBANDWIDTHSUMSOFGRAPHSYAOBING(姚兵);WANGJIANFANG(王建方)(DepartmentofMathematics,NorihwesteternNormalUniversity,Lanzhou730070,Chi... 相似文献
119.
Robert W. Baddeley 《Journal of Algebraic Combinatorics》1993,2(3):215-237
The paper addresses a part of the problem of classifying all 2-arc transitive graphs: namely, that of finding all groups acting 2-arc transitively on finite connected graphs such that there exists a minimal normal subgroup that is nonabelian and regular on vertices. A construction is given for such groups, together with the associated graphs, in terms of the following ingredients: a nonabelian simple group T, a permutation group P acting 2-transitively on a set , and a map F : Tsuch that x = x
–1 for all x
F() and such that Tis generated by F(). Conversely we show that all such groups and graphs arise in this way. Necessary and sufficient conditions are found for the construction to yield groups that are permutation equivalent in their action on the vertices of the associated graphs (which are consequently isomorphic). The different types of groups arising are discussed and various examples given. 相似文献
120.
The probability of first return to the initial intervalx and the diffusion tensorD
x are calculated exactly for a ballistic Lorentz gas on a Bethe lattice or Cayley tree. It consists of a moving particle and a fixed array of scatterers, located at the nodes, and the lengths of the intervals between scatterers are determined by a geometric distribution. The same values forx andD
x apply also to a regular space lattice with a fraction of sites occupied by a scatterer in the limit of a small concentration of scatterers. If backscattering occurs, the results are very different from the Boltzmann approximation. The theory is applied to different types of lattices and different types of scatterers having rotational or mirror symmetries. 相似文献