全文获取类型
收费全文 | 550篇 |
免费 | 53篇 |
国内免费 | 27篇 |
专业分类
化学 | 17篇 |
力学 | 4篇 |
综合类 | 14篇 |
数学 | 550篇 |
物理学 | 45篇 |
出版年
2024年 | 3篇 |
2023年 | 11篇 |
2022年 | 12篇 |
2021年 | 10篇 |
2020年 | 24篇 |
2019年 | 28篇 |
2018年 | 27篇 |
2017年 | 25篇 |
2016年 | 13篇 |
2015年 | 10篇 |
2014年 | 18篇 |
2013年 | 35篇 |
2012年 | 21篇 |
2011年 | 27篇 |
2010年 | 31篇 |
2009年 | 44篇 |
2008年 | 30篇 |
2007年 | 34篇 |
2006年 | 33篇 |
2005年 | 16篇 |
2004年 | 16篇 |
2003年 | 13篇 |
2002年 | 27篇 |
2001年 | 19篇 |
2000年 | 18篇 |
1999年 | 21篇 |
1998年 | 16篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有630条查询结果,搜索用时 15 毫秒
31.
Kinkar Ch. Das 《Graphs and Combinatorics》2007,23(6):625-632
Let G = (V,E) be a simple graph with n vertices, e edges and d1 be the highest degree. Further let λi, i = 1,2,...,n be the non-increasing eigenvalues of the Laplacian matrix of the graph G. In this paper, we obtain the following result: For connected graph G, λ2 = λ3 = ... = λn-1 if and only if G is a complete graph or a star graph or a (d1,d1) complete bipartite graph.
Also we establish the following upper bound for the number of spanning trees of G on n, e and d1 only:
The equality holds if and only if G is a star graph or a complete graph. Earlier bounds by Grimmett [5], Grone and Merris [6], Nosal [11], and Kelmans [2] were
sharp for complete graphs only. Also our bound depends on n, e and d1 only.
This work was done while the author was doing postdoctoral research in LRI, Université Paris-XI, Orsay, France. 相似文献
33.
Maria Chudnovsky Louis Esperet Laetitia Lemoine Peter Maceli Frédéric Maffray Irena Penev 《Journal of Graph Theory》2017,84(3):221-232
We prove that a graph G contains no induced ‐vertex path and no induced complement of a ‐vertex path if and only if G is obtained from 5‐cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement, where split unification is a new class‐preserving operation introduced here. 相似文献
34.
We show that a k‐edge‐connected graph on n vertices has at least spanning trees. This bound is tight if k is even and the extremal graph is the n‐cycle with edge multiplicities . For k odd, however, there is a lower bound , where . Specifically, and . Not surprisingly, c3 is smaller than the corresponding number for 4‐edge‐connected graphs. Examples show that . However, we have no examples of 5‐edge‐connected graphs with fewer spanning trees than the n‐cycle with all edge multiplicities (except one) equal to 3, which is almost 6‐regular. We have no examples of 5‐regular 5‐edge‐connected graphs with fewer than spanning trees, which is more than the corresponding number for 6‐regular 6‐edge‐connected graphs. The analogous surprising phenomenon occurs for each higher odd edge connectivity and regularity. 相似文献
35.
Gábor Wiener 《Journal of Graph Theory》2017,84(4):443-459
The minimum leaf number ml(G) of a connected graph G is defined as the minimum number of leaves of the spanning trees of G if G is not hamiltonian and 1 if G is hamiltonian. We study nonhamiltonian graphs with the property for each or for each . These graphs will be called ‐leaf‐critical and l‐leaf‐stable, respectively. It is far from obvious whether such graphs exist; for example, the existence of 3‐leaf‐critical graphs (that turn out to be the so‐called hypotraceable graphs) was an open problem until 1975. We show that l‐leaf‐stable and l‐leaf‐critical graphs exist for every integer , moreover for n sufficiently large, planar l‐leaf‐stable and l‐leaf‐critical graphs exist on n vertices. We also characterize 2‐fragments of leaf‐critical graphs generalizing a lemma of Thomassen. As an application of some of the leaf‐critical graphs constructed, we settle an open problem of Gargano et al. concerning spanning spiders. We also explore connections with a family of graphs introduced by Grünbaum in correspondence with the problem of finding graphs without concurrent longest paths. 相似文献
36.
For any graph G, let be the number of spanning trees of G, be the line graph of G, and for any nonnegative integer r, be the graph obtained from G by replacing each edge e by a path of length connecting the two ends of e. In this article, we obtain an expression for in terms of spanning trees of G by a combinatorial approach. This result generalizes some known results on the relation between and and gives an explicit expression if G is of order and size in which s vertices are of degree 1 and the others are of degree k. Thus we prove a conjecture on for such a graph G. 相似文献
37.
Reut Levi Guy Moshkovitz Dana Ron Ronitt Rubinfeld Asaf Shapira 《Random Structures and Algorithms》2017,50(2):183-200
Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded‐degree graph. Given an edge e in G we would like to decide whether e belongs to a connected subgraph consisting of edges (for a prespecified constant ), where the decision for different edges should be consistent with the same subgraph . Can this task be performed by inspecting only a constant number of edges in G ? Our main results are:
- We show that if every t‐vertex subgraph of G has expansion then one can (deterministically) construct a sparse spanning subgraph of G using few inspections. To this end we analyze a “local” version of a famous minimum‐weight spanning tree algorithm.
- We show that the above expansion requirement is sharp even when allowing randomization. To this end we construct a family of 3‐regular graphs of high girth, in which every t‐vertex subgraph has expansion . We prove that for this family of graphs, any local algorithm for the sparse spanning graph problem requires inspecting a number of edges which is proportional to the girth.
38.
It is well‐known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3‐connected planar graph has an edge xy such that deg(x) + deg (y) ≤ 13. In this article, considering a similar problem for the case of three or more vertices that induce a connected subgraph, we show that, for a given positive integer t, every 3‐connected planar graph G with |V(G)| ≥ t has a connected subgraph H of order t such that Σx∈V(H) degG(x) ≤ 8t − 1. As a tool for proving this result, we consider decompositions of 3‐connected planar graphs into connected subgraphs of order at least t and at most 2t − 1. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 191–203, 1999 相似文献
39.
We consider random subgraphs of a fixed graph with large minimum degree. We fix a positive integer k and let Gk be the random subgraph where each independently chooses k random neighbors, making kn edges in all. When the minimum degree then Gk is k‐connected w.h.p. for ; Hamiltonian for k sufficiently large. When , then Gk has a cycle of length for . By w.h.p. we mean that the probability of non‐occurrence can be bounded by a function (or ) where . © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 143–157, 2017 相似文献
40.
Mirka Miller Joe Ryan Zdeněk Ryjáček Jakub Teska Petr Vrána 《Journal of Graph Theory》2013,74(1):67-80
If is a subclass of the class of claw‐free graphs, then is said to be stable if, for any , the local completion of G at any vertex is also in . If is a closure operation that turns a claw‐free graph into a line graph by a series of local completions and is stable, then for any . In this article, we study stability of hereditary classes of claw‐free graphs defined in terms of a family of connected closed forbidden subgraphs. We characterize line graph preimages of graphs in families that yield stable classes, we identify minimal families that yield stable classes in the finite case, and we also give a general background for techniques for handling unstable classes by proving that their closure may be included into another (possibly stable) class. 相似文献