全文获取类型
收费全文 | 2769篇 |
免费 | 265篇 |
国内免费 | 125篇 |
专业分类
化学 | 253篇 |
晶体学 | 7篇 |
力学 | 21篇 |
综合类 | 33篇 |
数学 | 2471篇 |
物理学 | 374篇 |
出版年
2024年 | 11篇 |
2023年 | 51篇 |
2022年 | 75篇 |
2021年 | 52篇 |
2020年 | 112篇 |
2019年 | 103篇 |
2018年 | 98篇 |
2017年 | 101篇 |
2016年 | 73篇 |
2015年 | 60篇 |
2014年 | 105篇 |
2013年 | 234篇 |
2012年 | 91篇 |
2011年 | 135篇 |
2010年 | 145篇 |
2009年 | 255篇 |
2008年 | 213篇 |
2007年 | 162篇 |
2006年 | 183篇 |
2005年 | 102篇 |
2004年 | 101篇 |
2003年 | 103篇 |
2002年 | 83篇 |
2001年 | 78篇 |
2000年 | 83篇 |
1999年 | 66篇 |
1998年 | 68篇 |
1997年 | 41篇 |
1996年 | 30篇 |
1995年 | 12篇 |
1994年 | 17篇 |
1993年 | 15篇 |
1992年 | 9篇 |
1991年 | 11篇 |
1990年 | 13篇 |
1989年 | 12篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 12篇 |
1984年 | 10篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1970年 | 1篇 |
排序方式: 共有3159条查询结果,搜索用时 46 毫秒
1.
Dr. Zaifa Shi Dr. Yihuang Jiang Dr. Jingxiong Yu Prof. Shanjun Chen Prof. Jun Chen Prof. Zichao Tang Prof. Lansun Zheng 《Chemistry (Weinheim an der Bergstrasse, Germany)》2022,28(8):e202103546
At present, the reactivity of cyclic alkanes is estimated by comparison with acyclic hydrocarbons. Due to the difference in the structure of cycloalkanes and acycloalkanes, the thermodynamic data obtained by analogy are not applicable. In this study, a molecular beam sampling vacuum ultraviolet photoionization time-of-flight mass spectrometer (MB-VUV-PI-TOFMS) was applied to study the low-temperature oxidation of cyclopentane (CPT) at a total pressure range from 1–3 atm and low-temperature range between 500 and 800 K. Low-temperature reaction products including cyclic olefins, cyclic ethers, and highly oxygenated intermediates (e. g., ketohydroperoxide KHP, keto-dihydroperoxide KDHP, olefinic hydroperoxides OHP and ketone structure products) were observed. Further investigation of the oxidation of CPT – electronic structure calculations – were carried out at the UCCSD(T)-F12a/aug-cc-pVDZ//B3LYP/6-31+ G(d,p) level to explore the reactivity of O2 molecules adding sequentially to cyclopentyl radicals. Experimental and theoretical observations showed that the dominant product channel in the reaction of CPT radicals with O2 is HO2 elimination yielding cyclopentene. The pathways of second and third O2 addition – the dissociation of hydroperoxide – were further confirmed. The results of this study will develop the low-temperature oxidation mechanism of CPT, which can be used for future research on accurately simulating the combustion process of CPT. 相似文献
2.
3.
For an integer , a graph is -hamiltonian if for any vertex subset with , is hamiltonian, and is -hamiltonian connected if for any vertex subset with , is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of -hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for , a line graph is -hamiltonian if and only if is -connected. In this paper we prove the following.(i) For an integer , the line graph of a claw-free graph is -hamiltonian if and only if is -connected.(ii) The line graph of a claw-free graph is 1-hamiltonian connected if and only if is 4-connected. 相似文献
4.
5.
6.
Given an ‐vertex pseudorandom graph and an ‐vertex graph with maximum degree at most two, we wish to find a copy of in , that is, an embedding so that for all . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in . Here, we provide a deterministic polynomial time algorithm that finds a given in any suitably pseudorandom graph . The pseudorandom graphs we consider are ‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, . A ‐bijumbled graph is characterised through the discrepancy property: for any two sets of vertices and . Our condition on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications. 相似文献
7.
8.
9.
Martín D. Safe 《Journal of Graph Theory》2020,93(2):268-298
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization for the class of concave-round graphs, solving a problem posed by Bang-Jensen, Huang, and Yeo [SIAM J. Discrete Math., 13 (2000), pp. 179–193]. In addition, we show that it is possible to find one such forbidden induced subgraph in linear time in any given graph that is not concave-round. As part of the analysis, we obtain characterizations by minimal forbidden submatrices for the circular-ones property for rows and for the circular-ones property for rows and columns and show that, also for both variants of the property, one of the corresponding forbidden submatrices can be found (if present) in any given matrix in linear time. We make some final remarks regarding connections to some classes of circular-arc graphs. 相似文献
10.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献