全文获取类型
收费全文 | 7206篇 |
免费 | 954篇 |
国内免费 | 401篇 |
专业分类
化学 | 759篇 |
晶体学 | 13篇 |
力学 | 504篇 |
综合类 | 95篇 |
数学 | 4533篇 |
物理学 | 2657篇 |
出版年
2024年 | 16篇 |
2023年 | 87篇 |
2022年 | 154篇 |
2021年 | 121篇 |
2020年 | 206篇 |
2019年 | 200篇 |
2018年 | 216篇 |
2017年 | 224篇 |
2016年 | 201篇 |
2015年 | 171篇 |
2014年 | 335篇 |
2013年 | 552篇 |
2012年 | 340篇 |
2011年 | 454篇 |
2010年 | 389篇 |
2009年 | 567篇 |
2008年 | 551篇 |
2007年 | 473篇 |
2006年 | 425篇 |
2005年 | 326篇 |
2004年 | 348篇 |
2003年 | 309篇 |
2002年 | 279篇 |
2001年 | 230篇 |
2000年 | 207篇 |
1999年 | 184篇 |
1998年 | 178篇 |
1997年 | 148篇 |
1996年 | 123篇 |
1995年 | 77篇 |
1994年 | 61篇 |
1993年 | 63篇 |
1992年 | 56篇 |
1991年 | 37篇 |
1990年 | 30篇 |
1989年 | 34篇 |
1988年 | 28篇 |
1987年 | 15篇 |
1986年 | 20篇 |
1985年 | 29篇 |
1984年 | 26篇 |
1983年 | 10篇 |
1982年 | 13篇 |
1981年 | 12篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1973年 | 2篇 |
1971年 | 2篇 |
排序方式: 共有8561条查询结果,搜索用时 78 毫秒
1.
2.
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. 相似文献
3.
Jing Yu Jingwei Han Chuanzhong Li 《Mathematical Methods in the Applied Sciences》2020,43(6):3076-3085
For the orthosymplectic Lie superalgebra , we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures. 相似文献
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.
Two new divalent copper (C1) and zinc (C2) chelates having the formulae [M(PIMC)2] (where M = Cu(II), Zn(II) and PIMC = Ligand [(E)-3-(((3-hydroxypyridin-2-yl)imino)methyl)-4H-chromen-4-one] were obtained and characterized by several techniques. Structures and geometries of the synthesized complexes were judged based on the results of alternative analytical and spectral tools supporting the proposed formulae. IR spectral data confirmed the coordination of the ligands to the copper and zinc centers as monobasic tridentate in the enol form. Thermal analysis, UV-Vis spectra and magnetic moment confirmed the geometry around the copper center to be tetrahedral, square pyramidal and octahedral. Study of the binding ability of the synthesized compounds with Circulating tumor DNA (CT-DNA) bas been evaluated applying UV-Vis spectral titration and viscosity measurements. The copper and zinc oxides were achieved from the copper and zinc nano-particles structures Schiff base complexes as the raw material after calcination for 5 hr at 600°C. On the other hand, synthesized of C1 and C2 NPs were used as suitable precursors to the preparation of CuO and ZnO NPs. Finally, the synthesized of the two complexes exhibited enhanced activity against the tested bacterial (Staphylococcus aureus and Escherichia Coli) and fungal strains (Candida albicans and Aspergillus fumigatus) as compared to HPIMC. Among all these synthesized compounds, C1 exhibits good cleaving ability compared to other newly synthesized C2. 相似文献
10.
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. 相似文献