全文获取类型
收费全文 | 5132篇 |
免费 | 418篇 |
国内免费 | 325篇 |
专业分类
化学 | 203篇 |
晶体学 | 2篇 |
力学 | 25篇 |
综合类 | 139篇 |
数学 | 5253篇 |
物理学 | 253篇 |
出版年
2024年 | 15篇 |
2023年 | 97篇 |
2022年 | 138篇 |
2021年 | 129篇 |
2020年 | 197篇 |
2019年 | 223篇 |
2018年 | 214篇 |
2017年 | 201篇 |
2016年 | 123篇 |
2015年 | 90篇 |
2014年 | 173篇 |
2013年 | 438篇 |
2012年 | 190篇 |
2011年 | 292篇 |
2010年 | 297篇 |
2009年 | 436篇 |
2008年 | 378篇 |
2007年 | 272篇 |
2006年 | 311篇 |
2005年 | 213篇 |
2004年 | 196篇 |
2003年 | 168篇 |
2002年 | 161篇 |
2001年 | 150篇 |
2000年 | 138篇 |
1999年 | 135篇 |
1998年 | 115篇 |
1997年 | 76篇 |
1996年 | 46篇 |
1995年 | 51篇 |
1994年 | 39篇 |
1993年 | 27篇 |
1992年 | 25篇 |
1991年 | 15篇 |
1990年 | 12篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有5875条查询结果,搜索用时 171 毫秒
131.
《Discrete Mathematics》2023,346(6):113349
The problem of reconstructing the characteristic polynomial of a graph of order at least 3 from the collection of characteristic polynomials of its vertex-deleted subgraphs was posed by Cvetkovi? in 1973 as a spectral counter part to the well-known Ulam's reconstruction conjecture. Over the last 50 years, this problem has received notable attention, many positive results have been obtained, but in the general case the problem is still unresolved. In particular, no counter example is found in literature. In this expository paper we survey classical and some more recent results concerning the polynomial reconstruction problem, discuss some related problems, variations and generalizations. 相似文献
132.
133.
Ronald L. Persky 《International Journal of Mathematical Education in Science & Technology》2013,44(6):927-928
In 1968, Leon Gerber compared (1 + x) a to its kth partial sum as a binomial series. His result is stated and, as an application of this result, a proof of the arithmetic mean–geometric mean inequality is presented. 相似文献
134.
Abstract The novel Cluj property indices are used for modeling the biological properties of dipeptides: the ACE inhibition activity of a set of 58 dipeptides and the bitter tasting activity of a set of 48 dipeptides, taken from the literature. The results are compared to those reported in some previous works. 相似文献
135.
In this paper, we construct a new class of finite groups whose common divisor graphs are complete graphs, while there is no prime dividing all the nontrivial degrees. 相似文献
136.
《Communications in Nonlinear Science & Numerical Simulation》2014,19(9):3313-3322
This paper addresses the bipartite flock control problem where a multi-agent system splits into two clusters upon internal or external excitations. Using structurally balanced signed graph theory, LaSalle’s invariance principle and Barbalat’s Lemma, we prove that the proposed algorithm guarantees a bipartite flocking behavior. In each of the two disjoint clusters, all individuals move with the same direction. Meanwhile, every pair of agents in different clusters moves with opposite directions. Moreover, all agents in the two separated clusters approach a common velocity magnitude, and collision avoidance among all agents is ensured as well. Finally, the proposed bipartite flock control method is examined by numerical simulations. The bipartite flocking motion addressed by this paper has its references in both natural collective motions and human group behaviors such as predator–prey and panic escaping scenarios. 相似文献
137.
Let G be a 2k-edge-connected graph with and let for every . A spanning subgraph F of G is called an L-factor, if for every . In this article, we show that if for every , then G has a k-edge-connected L-factor. We also show that if and for every , then G has a k-edge-connected L-factor. 相似文献
138.
《Discrete Mathematics》2019,342(5):1361-1377
Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W. Kantor’s non-classical , are stumbling stones for existing implementations of graph isomorphism tests. They appear to be extremely rare and even once constructed it is difficult to prove their high regularity. Yet some of them, like the McLaughlin graph on 275 vertices and Ivanov’s graph on 256 vertices are of profound beauty. This alone makes it an attractive goal to strive for their complete classification or, failing this, at least to get a deep understanding of them. Recently, one of the authors discovered new methods for proving high regularity of graphs. Using these techniques, in this paper we study a classical family of strongly regular graphs, originally discovered by A.E. Brouwer, A.V. Ivanov, and M.H. Klin in the late 80s. We analyse their symmetries and show that they are -regular but not 2-homogeneous. Thus we promote these graphs to the distinguished club of highly regular graphs with few symmetries. 相似文献
139.
140.
We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?0‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel. 相似文献