排序方式: 共有26条查询结果,搜索用时 31 毫秒
1.
《Acta Mechanica Solida Sinica》2011,(Z1):95-106
Stress calculation formulae for a ring have been obtained by using Airy stress function of the plane strain field with the decomposition of the solutions for normal stresses of Airy biharmonic equation into two parts when it is loaded under two opposite inside forces along a diameter. One part should fulfill a constraint condition about normal stress distribution along the circumference at an energy valley to do the minimum work. Other part is a stress residue constant. In order to verify these formulae and the computed results, the computed contour lines of equi-maximal shear stresses were plotted and quite compared with that of photo-elasticity test results. This constraint condition about normal stress distribution along circumference is confirmed by using Greens’ theorem. An additional compression exists along the circumference of the loaded ring, explaining the divorcement and displacement of singularity points at inner and outer boundaries. 相似文献
2.
3.
We introduce a closure concept in the class of line graphs and claw‐free graphs based on contractibility of certain subgraphs in the line graph preimage. The closure can be considered as a common generalization and strengthening of the reduction techniques of Catlin and Veldman and of the closure concept introduced by the first author. We show that the closure is uniquely determined and the closure operation preserves the circumference of the graph. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 37–48, 2003 相似文献
4.
There are numerous results bounding the circumference of certain 3‐connected graphs. There is no good bound on the size of the largest bond (cocircuit) of a 3‐connected graph, however. Oporowski, Oxley, and Thomas (J Combin Theory Ser B 57 (1993), 2, 239–257) proved the following result in 1993. For every positive integer k, there is an integer such that every 3‐connected graph with at least n vertices contains a ‐ or ‐minor. This result implies that the size of the largest bond in a 3‐connected graph grows with the order of the graph. Oporowski et al. obtained a huge function iteratively. In this article, we first improve the above authors' result and provide a significantly smaller and simpler function . We then use the result to obtain a lower bound for the largest bond of a 3‐connected graph by showing that any 3‐connected graph on n vertices has a bond of size at least . In addition, we show the following: Let G be a 3‐connected planar or cubic graph on n vertices. Then for any , G has a ‐minor with , and thus a bond of size at least . 相似文献
5.
如果连通图的G存在边割S,使得G-S的每一个连通分支都含有至少m个顶点,则称图G是m限制边连通的.本文刻画了周长为3的m限制边连通图. 相似文献
6.
7.
张莲珠 《新疆大学学报(理工版)》1992,9(4):27-33,45
设G=(V,E)是一个n阶无向简单图,本文证明了:设G是一个3-连通图,若G的每一个最长圈是控制圈,则G的周长c(G)≥min{n,2NC_2}或G同构于Petersen图,其中NC_2={|N(u)∪N(v)||u,v∈V(G),d(u,v)=2}。 相似文献
8.
Tao Jiang 《Journal of Graph Theory》2004,46(3):180-182
Given positive integers n and k, let gk(n) denote the maximum number of edges of a graph on n vertices that does not contain a cycle with k chords incident to a vertex on the cycle. Bollobás conjectured as an exercise in [2, p. 398, Problem 13] that there exists a function n(k) such that gk(n) = (k + 1)n ? (k + 1)2 for all n ≥ n(k). Using an old result of Bondy [ 3 ], we prove the conjecture, showing that n(k) ≤ 3 k + 3. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 180–182, 2004 相似文献
9.
10.
探讨了基于初等几何方法的圆周率π的数值计算的探索数学实验教学.展现了整个实验的实验设计,数据分析,发现、估计及验证规律的全过程. 相似文献