全文获取类型
收费全文 | 3039篇 |
免费 | 174篇 |
国内免费 | 118篇 |
专业分类
化学 | 107篇 |
晶体学 | 1篇 |
力学 | 32篇 |
综合类 | 30篇 |
数学 | 3027篇 |
物理学 | 134篇 |
出版年
2024年 | 13篇 |
2023年 | 58篇 |
2022年 | 83篇 |
2021年 | 50篇 |
2020年 | 116篇 |
2019年 | 109篇 |
2018年 | 104篇 |
2017年 | 97篇 |
2016年 | 61篇 |
2015年 | 59篇 |
2014年 | 93篇 |
2013年 | 312篇 |
2012年 | 92篇 |
2011年 | 151篇 |
2010年 | 151篇 |
2009年 | 289篇 |
2008年 | 222篇 |
2007年 | 195篇 |
2006年 | 183篇 |
2005年 | 115篇 |
2004年 | 105篇 |
2003年 | 95篇 |
2002年 | 91篇 |
2001年 | 72篇 |
2000年 | 69篇 |
1999年 | 64篇 |
1998年 | 57篇 |
1997年 | 40篇 |
1996年 | 36篇 |
1995年 | 15篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 13篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3331条查询结果,搜索用时 234 毫秒
11.
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 相似文献
12.
蕴涵代数与BCK代数 总被引:6,自引:0,他引:6
系统研究 Fuzzy蕴涵代数与 BCK代数之间的关系 ,给出 MV代数与 BCK代数之间的联系 ,建立正则 FI代数和对合 BCK代数的对偶代数 相似文献
13.
T-型树谱唯一性的一个简单刻画 总被引:1,自引:0,他引:1
图G称为谱唯一的,如果任何与G谱相同的图一定与G同构.一棵树称为T-型树如果其仅有一个最大度为3的顶点.本文给出了T-型树谱唯一性的一个简单刻画,从而完全解决了T-型树的谱唯一性问题. 相似文献
14.
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. 相似文献
15.
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 相似文献
16.
Yan WANG Rong Quan FENG 《数学学报(英文版)》2005,21(4):773-778
A Cayley map is a Cayley graph embedded in an orientable surface such that. the local rotations at every vertex are identical. In this paper, balanced regular Cayley maps for cyclic groups, dihedral groups, and generalized quaternion groups are classified. 相似文献
17.
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. 相似文献
18.
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.
19.
Quan Sen JIU Department of Mathematics Capital Normal University Beijing P.R.China Cheng HE Institute of Applied Mathematics Academy of Mathematics System Sciences Chinese Academy of Sciences Beijing P.R.China 《应用数学学报(英文版)》2004,(4)
In this paper we are interested in the sufficient conditions which guarantee the regularityof solutions of 3-D ideal magnetohydrodynamic equations in the arbitrary time interval [0,T].Fivesufficient conditions are given.Our results are motivated by two main ideas:one is to control theaccumulation of vorticity alone;the other is to generalize the corresponding geometric conditions of3-D Euler equations to 3-D ideal magnetohydrodynamic equations. 相似文献
20.
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 相似文献