首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   409篇
  免费   21篇
  国内免费   25篇
化学   1篇
综合类   14篇
数学   408篇
物理学   32篇
  2023年   6篇
  2022年   14篇
  2021年   10篇
  2020年   18篇
  2019年   17篇
  2018年   13篇
  2017年   15篇
  2016年   5篇
  2015年   4篇
  2014年   12篇
  2013年   43篇
  2012年   13篇
  2011年   14篇
  2010年   21篇
  2009年   34篇
  2008年   22篇
  2007年   22篇
  2006年   25篇
  2005年   26篇
  2004年   14篇
  2003年   14篇
  2002年   8篇
  2001年   16篇
  2000年   11篇
  1999年   13篇
  1998年   7篇
  1997年   6篇
  1996年   2篇
  1995年   4篇
  1994年   6篇
  1993年   3篇
  1992年   5篇
  1990年   1篇
  1989年   1篇
  1988年   1篇
  1987年   1篇
  1986年   1篇
  1985年   2篇
  1984年   1篇
  1982年   3篇
  1981年   1篇
排序方式: 共有455条查询结果,搜索用时 46 毫秒
1.
《Discrete Mathematics》2022,345(10):112984
Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of G?{1} is called minimal if S=G and there exists some sS such that S?{s,s?1}G. In this paper, we characterize distance-regular Cayley graphs Cay(G,S) of G under the condition that S is minimal.  相似文献   
2.
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.
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.  相似文献   
4.
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.  相似文献   
5.
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.  相似文献   
6.
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.  相似文献   
7.
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.  相似文献   
8.
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号