首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   211篇
  免费   3篇
  国内免费   6篇
化学   38篇
力学   6篇
综合类   2篇
数学   157篇
物理学   17篇
  2023年   5篇
  2022年   8篇
  2021年   1篇
  2020年   7篇
  2019年   6篇
  2018年   11篇
  2017年   3篇
  2016年   3篇
  2015年   1篇
  2014年   3篇
  2013年   16篇
  2012年   2篇
  2011年   15篇
  2010年   15篇
  2009年   20篇
  2008年   21篇
  2007年   10篇
  2006年   13篇
  2005年   7篇
  2004年   5篇
  2003年   11篇
  2002年   12篇
  2001年   7篇
  2000年   3篇
  1999年   2篇
  1998年   1篇
  1997年   2篇
  1996年   1篇
  1994年   1篇
  1993年   1篇
  1992年   1篇
  1989年   1篇
  1988年   2篇
  1984年   1篇
  1982年   1篇
  1979年   1篇
排序方式: 共有220条查询结果,搜索用时 15 毫秒
1.
2.
 Let kn be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001  相似文献   
3.
In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some of these along with some other recent advances on graph minors are surveyed. Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number 16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists Supported in part by the Research Grant P1–0297 and by the CRC program On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia  相似文献   
4.
The Randi? index R(G) of a (chemical) graph G is also called connectivity index. Hansen and Mélot [Variable neighborhood search for extremal graphs 6: analyzing bounds for the connectivity index, J. Chem. Inf. Comput. Sci. 43 (2003) 1-14] in their paper, characterized the chemical trees of given order and number of pendent vertices which have the minimum and maximum Randi? index, respectively. In this note, we point out the mistakes in the proofs of their results Theorems 8 and 10, while we still believe that the two theorems are true, and then we give their corrected proofs.  相似文献   
5.
The article reviews in brief, thede novo group additivity approach and, at length, the different topological approaches to obtain predictive and internally consistent correlations between various properties and structural features of molecules. The stress has mainly been on the molecular connectivity method. A new rational scheme for nomenclature of connectivity indices of different orders and types is introduced. The concept of the perturbation connectivity parameter developed by us recently has been applied to obtain correlations for molar refraction, boiling point, molar volume, heat of atomisation, heat of combustion, heat of vaporisation, magnetic susceptibility and critical constants of alkanes, alcohols and alkylbenzenes. A comparative study of various approaches reveals that the present perturbation topological approach has an edge over other similar methods.  相似文献   
6.
Our two original approaches, the first based on the topological (connectivity) index 3χv and the second based on the model of overlapping spheres (OS), were applied for the estimation of stability constants of copper(II) complexes (CuL) with ethylenediamines (N = 14) and diethylenetriamines (N = 8), and mixed complexes (CuLA) of amino acids and diethylenetriamines (N = 18). The stability constants of the ethylenediamine complexes were predicted “indirectly” from calibration models developed on diethylenetriamines and vice versa, and also by a more direct method using the leave-one-out procedure of cross validation (cv). By averaging all the estimates, stability constants were reproduced with a rms error of 0.56 and 0.43 log K units for diethylenetriamines and ethylenediamines, respectively.  相似文献   
7.
8.
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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