全文获取类型
收费全文 | 577篇 |
免费 | 50篇 |
国内免费 | 87篇 |
专业分类
化学 | 75篇 |
力学 | 13篇 |
综合类 | 70篇 |
数学 | 464篇 |
物理学 | 92篇 |
出版年
2024年 | 1篇 |
2023年 | 18篇 |
2022年 | 10篇 |
2021年 | 10篇 |
2020年 | 12篇 |
2019年 | 15篇 |
2018年 | 11篇 |
2017年 | 18篇 |
2016年 | 19篇 |
2015年 | 27篇 |
2014年 | 36篇 |
2013年 | 28篇 |
2012年 | 20篇 |
2011年 | 26篇 |
2010年 | 37篇 |
2009年 | 25篇 |
2008年 | 51篇 |
2007年 | 30篇 |
2006年 | 27篇 |
2005年 | 22篇 |
2004年 | 34篇 |
2003年 | 28篇 |
2002年 | 29篇 |
2001年 | 27篇 |
2000年 | 28篇 |
1999年 | 22篇 |
1998年 | 20篇 |
1997年 | 14篇 |
1996年 | 19篇 |
1995年 | 10篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 3篇 |
1991年 | 8篇 |
1990年 | 3篇 |
1989年 | 7篇 |
1986年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
排序方式: 共有714条查询结果,搜索用时 109 毫秒
41.
42.
43.
Let G =(V,E) be a graph without isolated vertices.A set S V is a domination set of G if every vertex in V -S is adjacent to a vertex in S,that is N[S] = V .The domination number of G,denoted by γ(G),is the minimum cardinality of a domination set of G.A set S V is a paired-domination set of G if S is a domination set of G and the induced subgraph G[S]has a perfect matching.The paired-domination number,denoted by γpr(G),is defined to be the minimum cardinality of a paired-domination set S in G.A subset S V is a power domination set of G if all vertices of V can be observed recursively by the following rules:(i) all vertices in N[S] are observed initially,and(ii) if an observed vertex u has all neighbors observed except one neighbor v,then v is observed(by u).The power domination number,denoted by γp(G),is the minimum cardinality of a power domination set of G.In this paper,the constructive characterizations for trees with γp = γ and γpr = γp are provided respectively. 相似文献
44.
针对应用全概率公式计算复杂事件概率时遇到的问题,提出采用概率树进行分析的方法.该方法能使试验的整个过程更加清楚直观,易于理解和分析;而且乘法原理与加法原理的应用,便于掌握和计算,从而能使复杂问题得以有效解决. 相似文献
45.
Path Decomposition of Graphs with Given Path Length 总被引:3,自引:0,他引:3
Ming-qing Zhai~ 《应用数学学报(英文版)》2006,22(4):633-638
A path decomposition of a graph G is a list of paths such that each edge appears in exactly onepath in the list.G is said to admit a {P_l}-decomposition if G can be decomposed into some copies of P_l,whereP_l is a path of length l-1.Similarly,G is said to admit a {P_l,P_k}=decomposition if G can be decomposed intosome copies of P_l or P_k.An k-cycle,denoted by C_k,is a cycle with k vertices.An odd tree is a tree of which allvertices have odd degree.In this paper,it is shown that a connected graph G admits a {P_3,P_4}-decompositionif and only if G is neither a 3-cycle nor an odd tree.This result includes the related result of Yan,Xu andMutu.Moreover,two polynomial algorithms are given to find {P_3}-decomposition and {P_3,P_4}-decompositionof graphs,respectively.Hence,{P_3}-decomposition problem and {P_3,P_4}-decomposition problem of graphs aresolved completely. 相似文献
46.
Eduardo lvarez-Miranda Alfredo Candia-Vjar Xu-jin CHEN Xiao-dong HU Bi LI 《应用数学学报(英文版)》2014,30(1):1-26
Given a connected graph G=(V,E)with a nonnegative cost on each edge in E,a nonnegative prize at each vertex in V,and a target set V′V,the Prize Collecting Steiner Tree(PCST)problem is to find a tree T in G interconnecting all vertices of V′such that the total cost on edges in T minus the total prize at vertices in T is minimized.The PCST problem appears frequently in practice of operations research.While the problem is NP-hard in general,it is polynomial-time solvable when graphs G are restricted to series-parallel graphs.In this paper,we study the PCST problem with interval costs and prizes,where edge e could be included in T by paying cost xe∈[c e,c+e]while taking risk(c+e xe)/(c+e c e)of malfunction at e,and vertex v could be asked for giving a prize yv∈[p v,p+v]for its inclusion in T while taking risk(yv p v)/(p+v p v)of refusal by v.We establish two risk models for the PCST problem with interval data.Under given budget upper bound on constructing tree T,one model aims at minimizing the maximum risk over edges and vertices in T and the other aims at minimizing the sum of risks over edges and vertices in T.We propose strongly polynomial-time algorithms solving these problems on series-parallel graphs to optimality.Our study shows that the risk models proposed have advantages over the existing robust optimization model,which often yields NP-hard problems even if the original optimization problems are polynomial-time solvable. 相似文献
47.
强偏差定理一直是国际概率论界研究的中心课题之一.通过构造适当的非负鞅,将Doob鞅收敛定理应用于几乎处处收敛的研究,给出了一类特殊非齐次树上连续状态马氏泛函的若干强偏差定理. 相似文献
48.
49.
数学化学中,第二几何算术指标是新近提出的一个图的拓扑指标,它与Szeged指标和点PI指标具有紧密关系.如果树的一个顶点υ的度大于等于3,则称顶点υ是其一个分支点.通过树的第二几何算术指标的一个增加或减少的变换,刻画了k-分支星状树的第二几何算术指标的最值,同时确定了相应的极图. 相似文献
50.
陈协彬 《数学物理学报(A辑)》2003,23(1):65-76
设G是路或圈的笛卡尔乘积图,t(G)表示G的支撑树数.该文借助于第二类Chebyshev多项式给出t(G)的公式,并考虑了t(G)的线性递归关系及渐近性态. 相似文献