全文获取类型
收费全文 | 501篇 |
免费 | 38篇 |
国内免费 | 27篇 |
专业分类
化学 | 2篇 |
综合类 | 17篇 |
数学 | 515篇 |
物理学 | 32篇 |
出版年
2023年 | 8篇 |
2022年 | 17篇 |
2021年 | 11篇 |
2020年 | 22篇 |
2019年 | 23篇 |
2018年 | 20篇 |
2017年 | 23篇 |
2016年 | 11篇 |
2015年 | 6篇 |
2014年 | 14篇 |
2013年 | 46篇 |
2012年 | 15篇 |
2011年 | 18篇 |
2010年 | 32篇 |
2009年 | 43篇 |
2008年 | 25篇 |
2007年 | 25篇 |
2006年 | 32篇 |
2005年 | 28篇 |
2004年 | 18篇 |
2003年 | 19篇 |
2002年 | 11篇 |
2001年 | 18篇 |
2000年 | 14篇 |
1999年 | 14篇 |
1998年 | 10篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1982年 | 3篇 |
1981年 | 1篇 |
排序方式: 共有566条查询结果,搜索用时 31 毫秒
1.
《Discrete Mathematics》2022,345(10):112984
Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of is called minimal if and there exists some such that . In this paper, we characterize distance-regular Cayley graphs of G under the condition that S is minimal. 相似文献
2.
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. 相似文献
3.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
4.
STRONG LAW OF LARGE NUMBERS AND ASYMPTOTIC EQUIPARTITION PROPERTY FOR NONSYMMETRIC MARKOV CHAIN FIELDS ON CAYLEY TREES 总被引:1,自引:0,他引:1
Some strong laws of large numbers for the frequcncies of occurrence of states and ordered couples of states for nonsymmetric Markov chain fields(NSMC)on Cayley trees are studied.In the proof,a new technique for the study of strong liinit theorems of Markov chains is extended to the case of Markov chain fields.The asymptotic equiparti- tion properties with almost everywhere(a.e.)convergence for NSMC on Cayley trees are obtained. 相似文献
5.
Book embedding of graphs is one of the graph layout problem. It is useful for the multiprocessor network layout or the fault-tolerant processor arrays. We show that the trivalent Cayley graphs proposed by Vadapalli and Srimani can be embedded in five pages, and show some additional results on cube-connected cycles. 相似文献
6.
The lattice model for equilibrium polymerization in a solvent proposed by Wheeler and Pfeuty is solved exactly on a Bethe lattice (core of a Caylay tree) with general coordination numberq. Earlier mean-field results are reobtained in the limitq, but the phase diagrams show deviations from them for finiteq. Whenq=2, our results turn into the solution of the one-dimensional problem. Although the model is solved directly, without the use of the correspondence between the equilibrium polymerization model and the diluten0 model, we verified that the latter model may also be solved on the Bethe lattice, its solution being identical to the direct solution in all parameter space. As observed in earlier studies of the puren0 vector model, the free energy is not always convex. We obtain the region of negative susceptibility for our solution and compare this result with mean field and renormalization group (-expansion) calculations. 相似文献
7.
The probability of first return to the initial intervalx and the diffusion tensorD
x are calculated exactly for a ballistic Lorentz gas on a Bethe lattice or Cayley tree. It consists of a moving particle and a fixed array of scatterers, located at the nodes, and the lengths of the intervals between scatterers are determined by a geometric distribution. The same values forx andD
x apply also to a regular space lattice with a fraction of sites occupied by a scatterer in the limit of a small concentration of scatterers. If backscattering occurs, the results are very different from the Boltzmann approximation. The theory is applied to different types of lattices and different types of scatterers having rotational or mirror symmetries. 相似文献
8.
Shlomo Havlin James E. Kiefer George H. Weiss Daniel Benavraham Yehoshua Glazer 《Journal of statistical physics》1985,41(3-4):489-496
We discuss and analyze a family of trees grown on a Cayley tree, that allows for a variable exponent in the expression for the mass as a function of chemical distance, M(l)l
dl
. For the suggested model, the corresponding exponent for the mass of the skeleton,d
l
s
, can be expressed in terms ofd
l
asd
l
s
= 1,d
l
d
l
c
= 2;d
l
s
= d
l
–1,d
1
d
l
c
= 2, which implies that the tree is finitely ramified ford
l
2 and infinitely ramified whend
l
2. Our results are derived using a recursion relation that takes advantage of the one-dimensional nature of the problem. We also present results for the diffusion exponents and probability of return to the origin of a random walk on these trees. 相似文献
9.
10.