首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1805篇
  免费   40篇
  国内免费   3篇
化学   1292篇
晶体学   3篇
力学   58篇
数学   243篇
物理学   252篇
  2021年   11篇
  2020年   26篇
  2019年   19篇
  2018年   16篇
  2017年   16篇
  2016年   35篇
  2015年   27篇
  2014年   30篇
  2013年   50篇
  2012年   89篇
  2011年   86篇
  2010年   47篇
  2009年   50篇
  2008年   65篇
  2007年   67篇
  2006年   60篇
  2005年   64篇
  2004年   65篇
  2003年   45篇
  2002年   41篇
  2001年   26篇
  2000年   29篇
  1999年   20篇
  1998年   15篇
  1997年   22篇
  1996年   25篇
  1995年   24篇
  1994年   25篇
  1993年   12篇
  1992年   22篇
  1991年   21篇
  1990年   14篇
  1989年   12篇
  1988年   11篇
  1987年   18篇
  1986年   9篇
  1985年   16篇
  1984年   14篇
  1982年   12篇
  1980年   10篇
  1979年   18篇
  1978年   13篇
  1977年   13篇
  1976年   14篇
  1975年   16篇
  1974年   22篇
  1973年   8篇
  1972年   11篇
  1968年   290篇
  1967年   89篇
排序方式: 共有1848条查询结果,搜索用时 31 毫秒
131.
In this paper we continue the study of paired-domination in graphs introduced by Haynes and Slater (Networks 32 (1998), 199–206). A paired-dominating set of a graph G with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G, denoted by γ pr(G), is the minimum cardinality of a paired-dominating set of G. The graph G is paired-domination vertex critical if for every vertex v of G that is not adjacent to a vertex of degree one, γ pr(Gv) < γ pr(G). We characterize the connected graphs with minimum degree one that are paired-domination vertex critical and we obtain sharp bounds on their maximum diameter. We provide an example which shows that the maximum diameter of a paired-domination vertex critical graph is at least 3/2 (γ pr(G) − 2). For γ pr(G) ⩽ 8, we show that this lower bound is precisely the maximum diameter of a paired-domination vertex critical graph. The first author was supported in part by the South African National Research Foundation and the University of KwaZulu-Natal, the second author was supported by the Natural Sciences and Engineering Research Council of Canada.  相似文献   
132.
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The matching number is the maximum cardinality of a matching of G, while the total domination number of G is the minimum cardinality of a total dominating set of G. In this paper, we investigate the relationships between the matching and total domination number of a graph. We observe that the total domination number of every claw-free graph with minimum degree at least three is bounded above by its matching number, and we show that every k-regular graph with k?3 has total domination number at most its matching number. In general, we show that no minimum degree is sufficient to guarantee that the matching number and total domination number are comparable.  相似文献   
133.
The PE spectroscopic data for a series of [2.2]paracyclophanes with olefinic and/or aromatic bridges, and of a few related molecules are reported, together with tentative assignments based on simple MO models.  相似文献   
134.
135.
136.
The orientation behavior of isotactic polypropylene (iPP) in α‐ and β‐crystal form was investigated by rheo‐optical Fourier transformed infrared (FTIR) spectroscopy. This method enabled quantification of the degree of orientation as a feature of structural changes during uniaxial elongation in not only the crystalline phase but also the amorphous one. Molecular orientation mechanisms can be successfully derived from experimental results. Generally, three mechanisms were detected for iPP: (1) interlamellar separation in the amorphous phase, (2) interlamellar slip and lamellar twisting at small elongations, and (3) intralamellar slip at high elongations. The third mechanism was favored by α‐PP, whereas β‐PP favored the second mechanism, which, in fact, was responsible for the different mechanical properties of both materials at the macroscopic level. On the other hand, crystallization conditions may have significantly affected the amorphous orientation. Nevertheless, for both iPP types the chains in the amorphous phase always oriented less than did those in the crystalline phase. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 4478–4488, 2004  相似文献   
137.
Owari is an old African game that consists of cyclically ordered pits that are filled with pebbles. In a sowing move all the pebbles are taken out of one pit and distributed one by one in subsequent pits. Repeated sowing will give rise to recurrent states of the owari. Bouchet studied such periodical states in an idealised setup, where there are infinitely many pits. We characterise periodical states in owaris with finitely many pits. Our result implies Bouchet's result.  相似文献   
138.
139.
140.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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