全文获取类型
收费全文 | 189篇 |
免费 | 27篇 |
国内免费 | 18篇 |
专业分类
化学 | 2篇 |
力学 | 2篇 |
综合类 | 8篇 |
数学 | 219篇 |
物理学 | 3篇 |
出版年
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 3篇 |
2014年 | 6篇 |
2013年 | 23篇 |
2012年 | 14篇 |
2011年 | 9篇 |
2010年 | 11篇 |
2009年 | 11篇 |
2008年 | 18篇 |
2007年 | 13篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 15篇 |
2003年 | 9篇 |
2002年 | 5篇 |
2001年 | 11篇 |
2000年 | 10篇 |
1999年 | 3篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1985年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有234条查询结果,搜索用时 15 毫秒
21.
拓扑遍历映射的一些性质 总被引:11,自引:0,他引:11
本文研究拓扑遍历映射.指出对于由不可约方阵所决定的符号空间有限型子转移而言,或紧致交换群的仿射变换及线段上连续自映射而言,拓扑遍历与拓扑可迁这两个概念是一致的.同时还通过例子,指出拓扑遍历是不同于拓扑可迁与拓扑混合的概念. 相似文献
22.
一个Mendelsohn (Directed, 或Hybrid)三元系 MTS$(v, \lambda)$~(DTS$(v, \lambda)$,或HTS$(v,\lambda))$, 是由$v$元集$X$ 上的一些循环(可迁,或循环和可迁)三元组(简称区组)构成的集合${\cal B}$, 使得$X$上每个由不同元素组成的有序对都恰在 ${\cal B}$的$\lambda$个区组中出现.本文主要讨论了这三类有向三元系之间的一种关联关系,给出猜想:任意MTS$(v,\lambda)$的区组关联图$G(\ 相似文献
23.
《Journal of Graph Theory》2018,87(3):285-304
We initiate a general study of what we call orientation completion problems. For a fixed class of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in by orienting the (nonoriented) edges in P. Orientation completion problems commonly generalize several existing problems including recognition of certain classes of graphs and digraphs as well as extending representations of certain geometrically representable graphs. We study orientation completion problems for various classes of oriented graphs, including k‐arc‐strong oriented graphs, k‐strong oriented graphs, quasi‐transitive‐oriented graphs, local tournaments, acyclic local tournaments, locally transitive tournaments, locally transitive local tournaments, in‐tournaments, and oriented graphs that have directed cycle factors. We show that the orientation completion problem for each of these classes is either polynomial time solvable or NP‐complete. We also show that some of the NP‐complete problems become polynomial time solvable when the input‐oriented graphs satisfy certain extra conditions. Our results imply that the representation extension problems for proper interval graphs and for proper circular arc graphs are polynomial time solvable. The latter generalizes a previous result. 相似文献
24.
《Journal of Graph Theory》2018,87(3):305-316
For a finite set V and a positive integer k with , letting be the set of all k‐subsets of V, the pair is called the complete k‐hypergraph on V, while each k‐subset of V is called an edge. A factorization of the complete k‐hypergraph of index , simply a ‐factorization of order n, is a partition of the edges into s disjoint subsets such that each k‐hypergraph , called a factor, is a spanning subhypergraph of . Such a factorization is homogeneous if there exist two transitive subgroups G and M of the symmetric group of degree n such that G induces a transitive action on the set and M lies in the kernel of this action. In this article, we give a classification of homogeneous factorizations of that admit a group acting transitively on the edges of . It is shown that, for and , there exists an edge‐transitive homogeneous ‐factorization of order n if and only if is one of (32, 3, 5), (32, 3, 31), (33, 4, 5), , and , where and q is a prime power with . 相似文献
25.
Let M be a closed smooth manifold M, and let f : M → M be a diffeomorphism. In this paper, we consider a nontrivial transitive set Λ of f . We show that if f has the C1-stably average shadowing property on Λ, then Λ admits a dominated splitting. 相似文献
26.
The class of graphs that are 2‐path‐transitive but not 2‐arc‐transitive is investigated. The amalgams for such graphs are determined, and structural information regarding the full automorphism groups is given. It is then proved that a graph is 2‐path‐transitive but not 2‐arc‐transitive if and only if its line graph is half‐arc‐transitive, thus providing a method for constructing new families of half‐arc‐transitive graphs. © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 225–237, 2013 相似文献
27.
A classification of connected vertex‐transitive cubic graphs of square‐free order is provided. It is shown that such graphs are well‐characterized metacirculants (including dihedrants, generalized Petersen graphs, Möbius bands), or Tutte's 8‐cage, or graphs arisen from simple groups PSL(2, p). 相似文献
28.
Sanming Zhou 《Journal of Graph Theory》2014,75(1):37-47
Unitary graphs are arc‐transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of arc‐transitive graphs that admit an automorphism group acting imprimitively on the vertices. In this article, we prove that all unitary graphs are connected of diameter two and girth three. Based on this, we obtain, for any prime power , a lower bound of order on the maximum number of vertices in an arc‐transitive graph of degree and diameter two. 相似文献
29.
For every d and k, we determine the smallest order of a vertex‐transitive graph of degree d and diameter k, and in each such case we show that this order is achieved by a Cayley graph. 相似文献
30.