全文获取类型
收费全文 | 488篇 |
免费 | 38篇 |
国内免费 | 60篇 |
专业分类
化学 | 24篇 |
力学 | 15篇 |
综合类 | 9篇 |
数学 | 426篇 |
物理学 | 112篇 |
出版年
2024年 | 3篇 |
2023年 | 7篇 |
2022年 | 8篇 |
2021年 | 11篇 |
2020年 | 17篇 |
2019年 | 17篇 |
2018年 | 13篇 |
2017年 | 19篇 |
2016年 | 18篇 |
2015年 | 6篇 |
2014年 | 23篇 |
2013年 | 34篇 |
2012年 | 24篇 |
2011年 | 40篇 |
2010年 | 42篇 |
2009年 | 30篇 |
2008年 | 33篇 |
2007年 | 30篇 |
2006年 | 29篇 |
2005年 | 24篇 |
2004年 | 23篇 |
2003年 | 21篇 |
2002年 | 23篇 |
2001年 | 9篇 |
2000年 | 13篇 |
1999年 | 8篇 |
1998年 | 12篇 |
1997年 | 12篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1982年 | 1篇 |
1976年 | 4篇 |
排序方式: 共有586条查询结果,搜索用时 15 毫秒
1.
2.
本文提出了一种用波晶片产生无衍射涡旋空心光束的新方案. 根据晶体双折射的性质, 设计波晶片的厚度, 在一块晶体薄片上对o光和e光分别形成各自的四台阶相位板, 线偏振光入射到该相位板后, o光和e光衍射按强度叠加, 利用准伽利略望远镜系统聚焦, 得到近似无衍射涡旋空心光束. 光路简单, 调节方便. 在近轴条件下, 运用菲涅耳衍射理论和经典电磁场角动量理论, 数值模拟计算了周期数不同的两块波晶片相位板衍射光强和角动量的分布, 结果表明: 两块相位板都能在较长距离内产生近似无衍射涡旋空心光束, 光强和轨道角动量的分布与螺旋相位板产生的涡旋光束基本相同. 在衍射光路中加入相位补偿器, 调节o光和e光的相位差可以调节自旋角动量的大小, 从而可以调节总角动量密度和平均光子角动量的大小. 用这种空心光束导引冷原子或冷分子, 原子在与光子相互作用过程中可获得可调的转动力矩. 相似文献
3.
Mengyao Sun 《代数通讯》2018,46(11):4830-4843
In this paper, we study the regularity and projective dimension of edge ideals. We provide two upper bounds for the regularity of edge ideals of vertex decomposable graphs in terms of the induced matching number and the number of cycles. Also, we generalize one of the upper bounds given by Dao and Schweig for the projective dimension of hypergraphs. 相似文献
4.
Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (eg, the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. We also study several subclasses of this class. We use our structural results to analyze the complexity of the recognition, maximum weight clique, maximum weight stable set, and optimal vertex coloring problems for these classes. Furthermore, we obtain polynomial -bounding functions for these classes. 相似文献
5.
In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3. 相似文献
6.
We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?0‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel. 相似文献
7.
8.
For every simple graph G,a class of multiple clique cluster-whiskered graphs Geπm is introduced,and it is shown that all such graphs are vertex decomposable;thus,the independence simplicial complex IndGeπm is sequentially Cohen-Macaulay.The properties of the graphs Geπm and Gπ constructed by Cook and Nagel are studied,including the enumeration of facets of the complex Ind Gπ and the calculation of Betti numbers of the cover ideal Ic(Geπ").We also prove that the complex △ =IndH is strongly shellable and pure for either a Boolean graph H =Bn or the full clique-whiskered graph H =Gw of G,which is obtained by adding a whisker to each vertex of G.This implies that both the facet ideal I(△) and the cover ideal Ic(H) have linear quotients. 相似文献
9.
Let G be a graph. The Hosoya index Z(G) of a graph G is defined to be the total number of its matchings. In this paper, we characterize the graph with the smallest Hosoya index of bicyclic graphs with given pendent vertices. Finally, we present a new proof about the smallest Hosoya index of bicyclic graphs. 相似文献
10.
A classification of connected vertex‐transitive cubic graphs of square‐free order is provided. It is shown that such graphs are well‐characterized metacirculants (including dihedrants, generalized Petersen graphs, Möbius bands), or Tutte's 8‐cage, or graphs arisen from simple groups PSL(2, p). 相似文献