首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 796 毫秒
1.
2.
In this paper, we give sufficient conditions for a graph to have degree bounded trees. Let G be a connected graph and AV(G). We denote by σk(A) the minimum value of the degree sum in G of any k pairwise nonadjacent vertices of A, and by w(GA) the number of components of the subgraph GA of G induced by V(G)A. Our main results are the following: (i) If σk(A)|G|1, then G contains a tree T with maximum degree ⩽k and AV(T). (ii) If σkw(GA)(A)|A|1, then G contains a spanning tree T with dT(x)k for any xA. These are generalizations of the result by S. Win [S. Win, Existenz von Gerüsten mit Vorgeschriebenem Maximalgrad in Graphen, Abh. Math. Seminar Univ. Humburg 43 (1975) 263–267] and degree conditions are sharp.  相似文献   

3.
4.
5.
《Discrete Mathematics》2007,307(11-12):1232-1244
  相似文献   

6.
7.
8.
9.
10.
11.
12.
13.
14.
Let G be a connected graph with vertex set V(G) and edge set E(G). For a subset S of V(G), the Steiner distanced(S) of S is the minimum size of a connected subgraph whose vertex set contains S. For an integer k with 2kn?1, the Steinerk-Wiener indexSWk(G) is S?V(G),|S|=kd(S). In this paper, we introduce some transformations for trees that do not increase their Steiner k-Wiener index for 2kn?1. Using these transformations, we get a sharp lower bound on Steiner k-Wiener index for trees with given diameter, and obtain the corresponding extremal graph as well.  相似文献   

15.
16.
17.
18.
Let p>3 be a prime. For each maximal subgroup H?GL(d,p) with |H|?p3d+1, we construct a d-generator finite p-group G with the property that Aut(G) induces H on the Frattini quotient G/Φ(G) and |G|?pd42. A significant feature of this construction is that |G| is very small compared to |H|, shedding new light upon a celebrated result of Bryant and Kovács. The groups G that we exhibit have exponent p, and of all such groups G with the desired action of H on G/Φ(G), the construction yields groups with smallest nilpotency class, and in most cases, the smallest order.  相似文献   

19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号