全文获取类型
收费全文 | 867篇 |
免费 | 78篇 |
国内免费 | 62篇 |
专业分类
化学 | 66篇 |
晶体学 | 1篇 |
力学 | 42篇 |
综合类 | 18篇 |
数学 | 766篇 |
物理学 | 114篇 |
出版年
2024年 | 3篇 |
2023年 | 11篇 |
2022年 | 13篇 |
2021年 | 16篇 |
2020年 | 20篇 |
2019年 | 29篇 |
2018年 | 21篇 |
2017年 | 17篇 |
2016年 | 28篇 |
2015年 | 14篇 |
2014年 | 32篇 |
2013年 | 51篇 |
2012年 | 18篇 |
2011年 | 27篇 |
2010年 | 29篇 |
2009年 | 46篇 |
2008年 | 54篇 |
2007年 | 69篇 |
2006年 | 64篇 |
2005年 | 46篇 |
2004年 | 46篇 |
2003年 | 50篇 |
2002年 | 42篇 |
2001年 | 39篇 |
2000年 | 30篇 |
1999年 | 47篇 |
1998年 | 38篇 |
1997年 | 21篇 |
1996年 | 20篇 |
1995年 | 14篇 |
1994年 | 7篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1986年 | 1篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1980年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有1007条查询结果,搜索用时 15 毫秒
1.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献
2.
Annegret K. Wagler 《Mathematical Methods of Operations Research》2002,56(1):127-149
An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two
superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how
far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph
of a bipartite graph or from the complement of such a graph. 相似文献
3.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
4.
Krzysztof Pawaowski 《K-Theory》1998,13(1):41-55
The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery. 相似文献
6.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献
7.
In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal
constant composition codes meeting the upper bound given by [13]. 相似文献
8.
王军秀 《纯粹数学与应用数学》2007,23(3):406-408
利用欧拉公式研究了Gdk图的平面性,获得了一个重要定理,并由此得到了关于平面图色数的一个结论. 相似文献
9.
Andrea Vietri 《Graphs and Combinatorics》2007,23(1):111-121
We analyse 3-subset difference families of Z2d+1⊕Z2d+1 arising as reductions (mod 2d+1) of particular families of 3-subsets of Z⊕Z. The latter structures, namely perfect d-families, can be viewed as 2-dimensional analogues of difference triangle sets having the least scope. Indeed, every perfect d-family is a set of base blocks which, under the natural action of the translation group Z⊕Z, cover all edges {(x,y),(x′,y′)} such that |x−x′|, |y−y′|≤d. In particular, such a family realises a translation invariant (G,K3)-design, where V(G)=Z⊕Z and the edges satisfy the above constraint. For that reason, we regard perfect families as part of the hereby defined translation designs, which comprise and slightly generalise many structures already existing in the literature. The geometric context allows
some suggestive additional definitions. The main result of the paper is the construction of two infinite classes of d-families. Furthermore, we provide two sporadic examples and show that a d-family may exist only if d≡0,3,8,11 (mod 12). 相似文献
10.
In this article, we show how to construct pairs of orthogonal pandiagonal Latin squares and panmagic squares from certain types of modular n‐queens solutions. We prove that when these modular n‐queens solutions are symmetric, the panmagic squares thus constructed will be associative, where for an n × n associative magic square A = (aij), for all i and j it holds that aij + an?i?1,n?j?1 = c for a fixed c. We further show how to construct orthogonal Latin squares whose modular difference diagonals are Latin from any modular n‐queens solution. As well, we analyze constructing orthogonal pandiagonal Latin squares from particular classes of non‐linear modular n‐queens solutions. These pandiagonal Latin squares are not row cyclic, giving a partial solution to a problem of Hedayat. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 221–234, 2007 相似文献