全文获取类型
收费全文 | 3131篇 |
免费 | 173篇 |
国内免费 | 118篇 |
专业分类
化学 | 91篇 |
晶体学 | 1篇 |
力学 | 9篇 |
综合类 | 29篇 |
数学 | 3114篇 |
物理学 | 178篇 |
出版年
2024年 | 12篇 |
2023年 | 57篇 |
2022年 | 86篇 |
2021年 | 66篇 |
2020年 | 115篇 |
2019年 | 112篇 |
2018年 | 99篇 |
2017年 | 95篇 |
2016年 | 65篇 |
2015年 | 64篇 |
2014年 | 113篇 |
2013年 | 316篇 |
2012年 | 86篇 |
2011年 | 174篇 |
2010年 | 169篇 |
2009年 | 286篇 |
2008年 | 238篇 |
2007年 | 186篇 |
2006年 | 179篇 |
2005年 | 102篇 |
2004年 | 107篇 |
2003年 | 106篇 |
2002年 | 82篇 |
2001年 | 67篇 |
2000年 | 65篇 |
1999年 | 68篇 |
1998年 | 68篇 |
1997年 | 54篇 |
1996年 | 33篇 |
1995年 | 11篇 |
1994年 | 19篇 |
1993年 | 19篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 12篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有3422条查询结果,搜索用时 15 毫秒
11.
T-型树谱唯一性的一个简单刻画 总被引:1,自引:0,他引:1
图G称为谱唯一的,如果任何与G谱相同的图一定与G同构.一棵树称为T-型树如果其仅有一个最大度为3的顶点.本文给出了T-型树谱唯一性的一个简单刻画,从而完全解决了T-型树的谱唯一性问题. 相似文献
12.
Signed graphs for portfolio analysis in risk management 总被引:1,自引:0,他引:1
Harary Frank; Lim Meng-Hiot; Wunsch Donald C. 《IMA Journal of Management Mathematics》2002,13(3):201-210
We introduce the notion of structural balance for signed graphsin the context of portfolio analysis. A portfolio of securitiescan be represented as a signed graph with the nodes denotingthe securities and the edges representing the correlation betweenthe securities. With signed graphs, the characteristics of aportfolio from a risk management perspective can be uncoveredfor analysis purposes. It is shown that a portfolio characterizedby a signed graph of positive and negative edges that is structurallybalanced is characteristically more predictable. Investors whoundertake a portfolio position with all positively correlatedsecurities do so with the intention to speculate on the upside(or downside). If the portfolio consists of negative edges andis balanced, then it is likely that the position has a hedgingdisposition within it. On the other hand, an unbalanced signedgraph is representative of an investment portfolio which ischaracteristically unpredictable. 相似文献
13.
A graph G is N2‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N2‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005 相似文献
14.
A signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative depending on whether it contains an even or odd number of negative edges, respectively. We consider embeddings of a signed graph in the projective plane for which a simple cycle is essential if and only if it is negative. We characterize those signed graphs that have such a projective-planar embedding. Our characterization is in terms of a related signed graph formed by considering the theta subgraphs in the given graph. 相似文献
15.
In the present paper we give necessary and sufficient conditions for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated abelian vertex groups.
16.
Let f :X→X be a continuous map of a compact metric space to itself. We prove that f is topologically conjugate to an adding machine map if and only if X is an infinite minimal set for f and each point of X is regularly recurrent. Moreover, if X is an infinite minimal set for f and one point of X is regularly recurrent, then f is semiconjugate to an adding machine map. 相似文献
17.
对于那些由代数微分方程描述的具有输入输出关系的非线性控制系统,本文采用两种方法讨论了其最小实现问题:一种方法是直接计算系统的特征列;另一种方法则采用了本原元定理.两种方法给出的最小实现所需的状态变量最小数目是相等的.文中的大量代数与微分运算则可利用数学机械化来完成 相似文献
18.
Florin Ambro 《Central European Journal of Mathematics》2006,4(3):358-370
We describe the set of minimal log discrepancies of toric log varieties, and study its accumulation points.
This work is supported by a 21st Century COE Kyoto Mathematics Fellowship, and a JSPS Grant-in-Aid No 17740011. 相似文献
19.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ ()
n
−ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour
number μ(G) of G: n− (n−ω)()
n
−ω≤μ(G)≤n−α() α.
Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002 相似文献
20.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献