首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1368篇
  免费   19篇
  国内免费   52篇
化学   86篇
晶体学   1篇
力学   8篇
综合类   4篇
数学   1283篇
物理学   57篇
  2023年   31篇
  2022年   28篇
  2021年   24篇
  2020年   36篇
  2019年   59篇
  2018年   31篇
  2017年   26篇
  2016年   12篇
  2015年   20篇
  2014年   39篇
  2013年   114篇
  2012年   32篇
  2011年   98篇
  2010年   89篇
  2009年   145篇
  2008年   138篇
  2007年   77篇
  2006年   77篇
  2005年   31篇
  2004年   36篇
  2003年   42篇
  2002年   31篇
  2001年   27篇
  2000年   24篇
  1999年   15篇
  1998年   24篇
  1997年   13篇
  1996年   16篇
  1995年   14篇
  1994年   7篇
  1993年   8篇
  1992年   9篇
  1991年   7篇
  1990年   5篇
  1989年   3篇
  1988年   3篇
  1987年   1篇
  1986年   12篇
  1985年   6篇
  1984年   6篇
  1983年   3篇
  1982年   6篇
  1981年   5篇
  1980年   2篇
  1979年   1篇
  1978年   3篇
  1977年   2篇
  1972年   1篇
排序方式: 共有1439条查询结果,搜索用时 15 毫秒
111.
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer proved that if Δ (G1) Δ (G2) < 0.5n, then G1 and G2 pack. In this note, we study an Ore-type analogue of the Sauer–Spencer Theorem. Let θ(G) = max{d(u) + d(v): uvE(G)}. We show that if θ(G1)Δ(G2) < n, then G1 and G2 pack. We also characterize the pairs (G1,G2) of n-vertex graphs satisfying θ(G1)Δ(G2) = n that do not pack. This work was supported in part by NSF grant DMS-0400498. The work of the first author was also partly supported by grant 05-01-00816 of the Russian Foundation for Basic Research.  相似文献   
112.
We introduce a generalized dot product and provide some embedding conditions under which the genus of a graph does not rise under a dot product with the Petersen graph. Using these conditions, we disprove a conjecture of Tinsley and Watkins on the genus of dot products of the Petersen graph and show that both Grünbaum’s Conjecture and the Berge-Fulkerson Conjecture hold for certain infinite families of snarks. Additionally, we determine the orientable genus of four known snarks and two known snark families, construct a new example of an infinite family of snarks on the torus, and construct ten new examples of infinite families of snarks on the 2-holed torus; these last constructions allow us to show that there are genus-2 snarks of every even order n ≥ 18.  相似文献   
113.
We study the structure of generalized Baumslag–Solitar groups from the point of view of their (usually non-unique) splittings as fundamental groups of graphs of infinite cyclic groups. We find and characterize certain decompositions of smallest complexity (fully reduced decompositions) and give a simplified proof of the existence of deformations. We also prove a finiteness theorem and solve the isomorphism problem for generalized Baumslag–Solitar groups with no non-trivial integral moduli.   相似文献   
114.
连通的顶点可迁图的色唯一性   总被引:3,自引:0,他引:3  
本文给出从一个已知的顶点可迁的非色唯一图出发,构造无穷多个顶点可迁的非色唯一图的一种方法,据此给出若干类无穷多个连通的顶点可迁,但不是色唯一的图簇,从而进一步否定地回答了Chia在[1]中提出的问题.  相似文献   
115.
Let G = (V,E) be a simple graph with n vertices, e edges and d1 be the highest degree. Further let λi, i = 1,2,...,n be the non-increasing eigenvalues of the Laplacian matrix of the graph G. In this paper, we obtain the following result: For connected graph G, λ2 = λ3 = ... =  λn-1 if and only if G is a complete graph or a star graph or a (d1,d1) complete bipartite graph. Also we establish the following upper bound for the number of spanning trees of G on n, e and d1 only:
The equality holds if and only if G is a star graph or a complete graph. Earlier bounds by Grimmett [5], Grone and Merris [6], Nosal [11], and Kelmans [2] were sharp for complete graphs only. Also our bound depends on n, e and d1 only. This work was done while the author was doing postdoctoral research in LRI, Université Paris-XI, Orsay, France.  相似文献   
116.
《Discrete Mathematics》2023,346(5):113303
As widely regarded, one of the most classical and remarkable tools to measure the asymptotic normality of combinatorial statistics is due to Harper's real-rooted method proposed in 1967. However, this classical theorem exists some obvious shortcomings, for example, it requests all the roots of the corresponding generating function, which is impossible in general.Aiming to overcome this shortcoming in some extent, in this paper we present an improved asymptotic normality criterion, along with several variant versions, which usually just ask for one coefficient of the generating function, without knowing any roots. In virtue of these new criteria, the asymptotic normality of some usual combinatorial statistics can be revealed and extended. Among which, we introduce the applications to matching numbers and Laplacian coefficients in detail. Some relevant conjectures, proposed by Godsil (Combinatorica, 1981) and Wang et al. (J. Math. Anal. Appl., 2017), are generalized and verified as corollaries.  相似文献   
117.
The paper shows that representing structures, beams and frames by mathematical models based on graph theory enables to provide new perspective on known conjugate structure theorems in mechanics. It is shown that the latter theorems can be derived from the graph theoretical duality principle applied upon the graph representations of the structures. The results reported indicate upon theoretical value of the approach, as the established mathematical foundation can be employed in a variety of mechanical disciplines.  相似文献   
118.
Detection of protein complexes is very important to understand the principles of cellular organization and function. Recently, large protein–protein interactions (PPIs) networks have become available using high-throughput experimental techniques. These networks make it possible to develop computational methods for protein complex detection. Most of the current methods rely on the assumption that protein complex as a module has dense structure. However complexes have core-attachment structure and proteins in a complex core share a high degree of functional similarity, so it expects that a core has high weighted density. In this paper we present a Core-Attachment based method for protein complex detection from Weighted PPI Interactions using clustering coefficient and weighted density. Experimental results show that the proposed method, CAMWI improves the accuracy of protein complex detection.  相似文献   
119.
120.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号