首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1495篇
  免费   34篇
  国内免费   43篇
化学   111篇
晶体学   1篇
力学   10篇
综合类   4篇
数学   1370篇
物理学   76篇
  2025年   1篇
  2024年   5篇
  2023年   35篇
  2022年   31篇
  2021年   26篇
  2020年   41篇
  2019年   65篇
  2018年   34篇
  2017年   31篇
  2016年   14篇
  2015年   22篇
  2014年   46篇
  2013年   122篇
  2012年   39篇
  2011年   105篇
  2010年   93篇
  2009年   158篇
  2008年   144篇
  2007年   92篇
  2006年   79篇
  2005年   34篇
  2004年   37篇
  2003年   48篇
  2002年   33篇
  2001年   29篇
  2000年   25篇
  1999年   15篇
  1998年   25篇
  1997年   13篇
  1996年   19篇
  1995年   17篇
  1994年   7篇
  1993年   8篇
  1992年   9篇
  1991年   8篇
  1990年   5篇
  1989年   3篇
  1988年   3篇
  1987年   1篇
  1986年   12篇
  1985年   8篇
  1984年   7篇
  1983年   3篇
  1982年   6篇
  1981年   5篇
  1980年   2篇
  1979年   1篇
  1978年   3篇
  1977年   2篇
  1972年   1篇
排序方式: 共有1572条查询结果,搜索用时 15 毫秒
1.
本文是[1,12]的继续,研究描述架中概念的结构;本文讨论后半部分,内容涉及概念内涵与外延的转换,清晰关系的内投影与内变换,概念的结构*以及有关问题的注记。  相似文献   
2.
A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ.  相似文献   
3.
For a given n-by-n matrix A, we consider the set of matrices which commute with A and all of whose principal submatrices commute with the corresponding principal submatrices of A. The properties of this set are examined, with particular attention to its dimension.  相似文献   
4.
5.
Given a graph and a length function defined on its edge-set, the Traveling Salesman Problem can be described as the problem of finding a family of edges (an edge may be chosen several times) which forms a spanning Eulerian subgraph of minimum length. In this paper we characterize those graphs for which the convex hull of all solutions is given by the nonnegativity constraints and the classical cut constraints. This characterization is given in terms of excluded minors. A constructive characterization is also given which uses a small number of basic graphs.  相似文献   
6.
图中具有某种性质的子图   总被引:1,自引:0,他引:1  
设g和f是定义在图G的顶点集合V(G)上的整数值函数且对每个x∈V(G)都有0≤g(x)≤f(x)且g(x)和f(x)为偶数。本文证明了:若G是一个(mg+k-1,mf-k+1)-图,1≤k≤m,H是G中一个给定的有k条边的子图,则G存在一个子图R使得R有一个(g,f)-因子分解与H正交。  相似文献   
7.
微机Windows 9X平台上的分子模拟技术   总被引:5,自引:0,他引:5  
孙振范 《化学通报》2000,63(3):59-62
通过例子介绍了微机Windows平台上的分子模拟技术——分子结构的生成、分子力学量子化学计算及计算结果的图形显示等内容。  相似文献   
8.
A graph-theoretical analysis of certain -electron properties of alternant molecules with one heteroatom is given. Topological formulas for total -electron energy, -electron charge density, bond order and various polarizabilities are derived. The main results of the paper are summarized in Rules 1-7.  相似文献   
9.
The 60 even permutations of the ligands in the five-coordinate complexes, ML 5, form the alternating group A 5, which is isomorphic with the icosahedral pure rotation group I. Using this idea, it is shown how a regular icosahedron can be used as a topological representation for isomerizations of the five-coordinate complexes, ML 5, involving only even permutations if the five ligands L correspond either to the five nested octahedra with vertices located at the midpoints of the 30 edges of the icosahedron or to the five regular tetrahedra with vertices located at the midpoints of the 20 faces of the icosahedron. However, the 120 total permutations of the ligands in five-coordinate complexes ML 5 cannot be analogously represented by operations in the full icosahedral point group I h, since I his the direct product I×C2 whereas the symmetric group S 5 is only the semi-direct product A 5S2. In connection with previously used topological representations on isomerism in five-coordinate complexes, it is noted that the automorphism groups of the Petersen graph and the Desargues-Levi graph are isomorphic to the symmetric group S 5 and to the direct product S 5×S 2, respectively. Applications to various fields of chemistry are briefly outlined.  相似文献   
10.
Clar structures recently used as basis-set to compute resonance energies [9] are identified as maximal independent sets of benzenoid hydrocarbons colored in a special way. Binomial properties of such objects are induced for several catafusenes and perifusenes (Eqs. 2–31). Novel polynomials, called Clar polynomials, are given for perifusens in terms of units of catafusenes which allow display and enumeration of the populations of their Clar structures. The work is particularly pertinent to that of [8] and [9].This paper is dedicated to Professor Eric Clar; the Doyen of aromatic chemistry.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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