全文获取类型
收费全文 | 257篇 |
免费 | 26篇 |
国内免费 | 9篇 |
专业分类
化学 | 10篇 |
力学 | 1篇 |
综合类 | 2篇 |
数学 | 272篇 |
物理学 | 7篇 |
出版年
2024年 | 1篇 |
2023年 | 8篇 |
2022年 | 8篇 |
2021年 | 3篇 |
2020年 | 17篇 |
2019年 | 11篇 |
2018年 | 11篇 |
2017年 | 14篇 |
2016年 | 8篇 |
2015年 | 6篇 |
2014年 | 7篇 |
2013年 | 18篇 |
2012年 | 6篇 |
2011年 | 12篇 |
2010年 | 15篇 |
2009年 | 29篇 |
2008年 | 10篇 |
2007年 | 13篇 |
2006年 | 18篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 7篇 |
2002年 | 14篇 |
2001年 | 5篇 |
2000年 | 6篇 |
1999年 | 11篇 |
1998年 | 7篇 |
1997年 | 5篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
排序方式: 共有292条查询结果,搜索用时 46 毫秒
41.
Bhalchandra D. Thatte 《Journal of Graph Theory》2020,93(2):181-202
Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question. 相似文献
42.
43.
Keith Edwards 《Discrete Mathematics》2008,308(12):2396-2406
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. 相似文献
44.
Strongly Closed Subgraphs in a Distance-Regular Graph with <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript> > 1 总被引:1,自引:1,他引:0
Akira Hiraki 《Graphs and Combinatorics》2008,24(6):537-550
Let Γ be a distance-regular graph of diameter d ≥ 3 with c
2 > 1. Let m be an integer with 1 ≤ m ≤ d − 1. We consider the following conditions:
Suppose that the condition (SC)
m
holds. Then it has been known that the condition (BB)
i
holds for all i with 1 ≤ i ≤ m. Similarly we can show that the condition (CA)
i
holds for all i with 1 ≤ i ≤ m. In this paper we prove that if the conditions (BB)
i
and (CA)
i
hold for all i with 1 ≤ i ≤ m, then the condition (SC)
m
holds. Applying this result we give a sufficient condition for the existence of a dual polar graph as a strongly closed subgraph
in Γ. 相似文献
(SC) m : For any pair of vertices at distance m there exists a strongly closed subgraph of diameter m containing them. | |
(BB) m : Let (x, y, z) be a triple of vertices with ∂ Γ (x, y) = 1 and ∂ Γ (x, z) = ∂ Γ (y, z) = m. Then B(x, z) = B(y, z). | |
(CA) m : Let (x, y, z) be a triple of vertices with ∂ Γ (x, y) = 2, ∂ Γ (x, z) = ∂ Γ (y, z) = m and |C(z, x) ∩ C(z, y)| ≥ 2. Then C(x, z) ∪ A(x, z) = C(y, z) ∪ A(y, z). |
45.
Rundan Xing 《Linear and Multilinear Algebra》2016,64(9):1887-1898
46.
We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin [7] holds for all but finitely many graphs. We also use our method to prove special cases of a conjecture of Kahn [13]. In addition, we show that our method is particularly useful for computing the number of independent sets of small sizes in general regular graphs and Moore graphs, and we argue that it can be used in many other cases when dealing with graphs that have numerous structural restrictions. 相似文献
47.
48.
Alexander K. Kelmans 《Journal of Graph Theory》2000,35(3):206-221
Let G be a graph and p ϵ (0, 1). Let A(G, p) denote the probability that if each edge of G is selected at random with probability p then the resulting spanning subgraph of G is connected. Then A(G, p) is a polynomial in p. We prove that for every integer k ≥ 1 and every k‐tuple (m1, m2, … ,mk) of positive integers there exist infinitely many pairs of graphs G1 and G2 of the same size such that the polynomial A(G1, p) − A(G2, p) has exactly k roots x1 < x2 < ··· < xk in (0, 1) such that the multiplicity of xi is mi. We also prove the same result for the two‐terminal reliability polynomial, defined as the probability that the random subgraph as above includes a path connecting two specified vertices. These results are based on so‐called A‐ and T‐multiplying constructions that are interesting in themselves. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 206–221, 2000 相似文献
49.
A lambda in a graph G is two edges uv and vw such that uw is not an edge. A subgraph A of G is called a lambda-subgraph if every lambda of G has both or neither of its edges in A. We describe the decomposition of a graph into its lambda subgraphs and use this to prove a decomposition theorem of Gallai (Acta Math. Acad. Sci. Hungar. 18 (1967), 25–66). A corollary is that a graph is perfect if and only if each of its edge-minimal lambda subgraphs is. © 1997 John Wiley & Sons, Inc. J Graph Theory 26:9–16, 1997 相似文献
50.
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 相似文献