共查询到20条相似文献,搜索用时 796 毫秒
2.
In this paper, we give sufficient conditions for a graph to have degree bounded trees. Let G be a connected graph and . We denote by the minimum value of the degree sum in G of any k pairwise nonadjacent vertices of A, and by the number of components of the subgraph of G induced by . Our main results are the following: (i) If , then G contains a tree T with maximum degree ⩽k and . (ii) If , then G contains a spanning tree T with for any . 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.
6.
《Discrete Mathematics》2006,306(19-20):2314-2326
7.
8.
10.
11.
《Discrete Mathematics》2007,307(17-18):2226-2234
12.
13.
《Discrete Mathematics》2007,307(11-12):1306-1316
14.
Let be a connected graph with vertex set and edge set . For a subset of , the Steiner distance of is the minimum size of a connected subgraph whose vertex set contains . For an integer with , the Steiner-Wiener index is . In this paper, we introduce some transformations for trees that do not increase their Steiner -Wiener index for . Using these transformations, we get a sharp lower bound on Steiner -Wiener index for trees with given diameter, and obtain the corresponding extremal graph as well. 相似文献
15.
16.
18.
John Bamberg S.P. Glasby Luke Morgan Alice C. Niemeyer 《Journal of Pure and Applied Algebra》2018,222(10):2931-2951
Let be a prime. For each maximal subgroup with , we construct a d-generator finite p-group G with the property that induces H on the Frattini quotient and . A significant feature of this construction is that is very small compared to , 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 , the construction yields groups with smallest nilpotency class, and in most cases, the smallest order. 相似文献
19.
《Comptes Rendus Mathematique》2008,346(13-14):707-710