首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   286篇
  免费   26篇
  国内免费   32篇
化学   3篇
力学   4篇
综合类   12篇
数学   312篇
物理学   13篇
  2023年   1篇
  2022年   7篇
  2021年   2篇
  2020年   13篇
  2019年   7篇
  2018年   9篇
  2017年   13篇
  2016年   7篇
  2015年   4篇
  2014年   8篇
  2013年   22篇
  2012年   7篇
  2011年   13篇
  2010年   20篇
  2009年   33篇
  2008年   24篇
  2007年   11篇
  2006年   30篇
  2005年   16篇
  2004年   7篇
  2003年   11篇
  2002年   13篇
  2001年   8篇
  2000年   11篇
  1999年   10篇
  1998年   6篇
  1997年   7篇
  1996年   5篇
  1995年   3篇
  1994年   3篇
  1993年   2篇
  1992年   2篇
  1991年   2篇
  1989年   1篇
  1988年   1篇
  1986年   1篇
  1983年   1篇
  1980年   1篇
  1979年   2篇
排序方式: 共有344条查询结果,搜索用时 31 毫秒
51.
First, let m and n be positive integers such that n is odd and gcd(m,n)=1. Let G be the semidirect product of cyclic groups given by . Then the number of hamilton paths in Cay(G:x,y) (with initial vertex 1) is one fewer than the number of visible lattice points that lie on the closed quadrilateral whose vertices in consecutive order are (0,0), (4mn2+2n,16m2n), (n,4m), and (0,8m). Second, let m and n be positive integers such that n is odd. Let G be the semidirect product of cyclic groups given by . Then the number of hamilton paths in Cay(G:x,y) (with initial vertex 1) is (3m-1)n+m⌊(n+1)/3⌋+1.  相似文献   
52.
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded sized components. We have previously given bounds on this parameter for the class of graphs satisfying a given constant bound on maximum degree. In this paper, we give fragmentability bounds for some classes of graphs of bounded average degree, as well as classes of given thickness, the class of k-colourable graphs, and the class of n-dimensional cubes. In order to establish the fragmentability results for bounded average degree, we prove that the proportion of vertices that must be removed from a graph of average degree at most in order to leave behind a planar subgraph (in fact, a series-parallel subgraph) is at most , provided or the graph is connected and . The proof yields an algorithm for finding large induced planar subgraphs and (under certain conditions) a lower bound on the size of the induced planar subgraph it finds. This bound is similar in form to the one we found for a previous algorithm we developed for that problem, but applies to a larger class of graphs.  相似文献   
53.
Mader conjectured that for all there is an integer such that every digraph of minimum outdegree at least contains a subdivision of a transitive tournament of order . In this note, we observe that if the minimum outdegree of a digraph is sufficiently large compared to its order then one can even guarantee a subdivision of a large complete digraph. More precisely, let be a digraph of order n whose minimum outdegree is at least d. Then contains a subdivision of a complete digraph of order . © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 1–6, 2008  相似文献   
54.
We study a family of digraphs (directed graphs) that generalises the class of Cayley digraphs. For nonempty subsets of a group G, we define the two‐sided group digraph to have vertex set G, and an arc from x to y if and only if for some and . In common with Cayley graphs and digraphs, two‐sided group digraphs may be useful to model networks as the same routing and communication scheme can be implemented at each vertex. We determine necessary and sufficient conditions on L and R under which may be viewed as a simple graph of valency , and we call such graphs two‐sided group graphs. We also give sufficient conditions for two‐sided group digraphs to be connected, vertex‐transitive, or Cayley graphs. Several open problems are posed. Many examples are given, including one on 12 vertices with connected components of sizes 4 and 8.  相似文献   
55.
We survey results concerning various generalizations of tournaments. The reader will see that tournaments are by no means the only class of directed graphs with a very rich structure. We describe, among numerous other topics mostly related to paths and cycles, results on hamiltonian paths and cycles. The reader will see that although these problems are polynomially solvable for all of the classes described, they can be highly nontrivial, even for these “tournament-like” digraphs. © 1998 John Wiley & Sons, Inc. J. Graph Theory 28: 171–202, 1998  相似文献   
56.
The leafage of a digraph is the minimum number of leaves in a host tree in which it has a subtree intersection representation. We discuss bounds on the leafage in terms of other parameters (including Ferrers dimension), obtaining a string of sharp inequalities. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 340–353, 1999  相似文献   
57.
Local bases of primitive non-powerful signed digraphs   总被引:3,自引:0,他引:3  
In 1994, Z. Li, F. Hall and C. Eschenbach extended the concept of the index of convergence from nonnegative matrices to powerful sign pattern matrices. Recently, Jiayu Shao and Lihua You studied the bases of non-powerful irreducible sign pattern matrices. In this paper, the local bases, which are generalizations of the base, of primitive non-powerful signed digraphs are introduced, and sharp bounds for local bases of primitive non-powerful signed digraphs are obtained. Furthermore, extremal digraphs are described.  相似文献   
58.
A kernel N of a digraph D is an independent set of vertices of D such that for every wV(D)−N there exists an arc from w to N. If every induced subdigraph of D has a kernel, D is said to be a kernel perfect digraph. D is called a critical kernel imperfect digraph when D has no kernel but every proper induced subdigraph of D has a kernel. If F is a set of arcs of D, a semikernel modulo F of D is an independent set of vertices S of D such that for every zV(D)−S for which there exists an (S,z)-arc of DF, there also exists an (z,S)-arc in D. In this work we show sufficient conditions for an infinite digraph to be a kernel perfect digraph, in terms of semikernel modulo F. As a consequence it is proved that symmetric infinite digraphs and bipartite infinite digraphs are kernel perfect digraphs. Also we give sufficient conditions for the following classes of infinite digraphs to be kernel perfect digraphs: transitive digraphs, quasi-transitive digraphs, right (or left)-pretransitive digraphs, the union of two right (or left)-pretransitive digraphs, the union of a right-pretransitive digraph with a left-pretransitive digraph, the union of two transitive digraphs, locally semicomplete digraphs and outward locally finite digraphs.  相似文献   
59.
In this paper we give a criterion for the adjacency matrix of a Cayley digraph to be normal in terms of the Cayley subset S. It is shown with the use of this result that the adjacency matrix of every Cayley digraph on a finite group G is normal iff G is either abelian or has the form for some non-negative integer n, where Q8 is the quaternion group and is the abelian group of order 2n and exponent 2.  相似文献   
60.
研究了围长为2的无限布尔方阵的本原性,通过无限有向图D(A)的直径给出了这类矩阵的本原指数的上确界,最后证明了直径小于等于d且围长为2的本原无限布尔方阵所构成的矩阵类的本原指数集为Ed^0={2,3,…,3d}.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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