On a Spanning K-tree Containing Specified Vertices in a Graph

被引：0
|
作者：
Song, Fei-fei [1 ]
Hu, Zhi-quan [2 ]
机构：
[1] Henan Agr Univ, Dept Informat & Computat Sci, Zhengzhou 450002, Peoples R China
[2] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China
来源：
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES | 2019年 / 35卷 / 04期
基金：
中国国家自然科学基金;
关键词：
spanning tree; k-tree; (s+1)-connected graphs; degree sum condition; specified vertices;
D O I：
10.1007/s10255-019-0864-0
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A k-tree is a tree with maximum degree at most k. In this paper, we give a sharp degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than t, where 1 <= t <= k. We denote by sigma(k)(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k >= 2, s >= 0 and 1 <= t <= k be integers, and suppose G is an (s + 1)-connected graph with sigma(k)(G) >= divide G divide + (k - t)s - 1. Then for any s specified vertices, G contains a spanning k-tree in which every specified vertex has degree at most t. This improves a result obtained by Matsuda and Matsumura.
引用
收藏
页码：919 / 923
页数：5
相关论文
共 50 条
  • [1] On a Spanning K-tree Containing Specified Vertices in a Graph
    Fei-fei Song
    Zhi-quan Hu
    Acta Mathematicae Applicatae Sinica, English Series, 2019, 35 : 919 - 923
  • [2] On a Spanning K-tree Containing Specified Vertices in a Graph
    Fei-fei SONG
    Zhi-quan HU
    ActaMathematicaeApplicataeSinica, 2019, 35 (04) : 919 - 923
  • [3] Spanning k-tree with specified vertices
    Song, Feifei
    Zhou, Jianjie
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2019, 11 (04)
  • [4] A k-Tree Containing Specified Vertices
    Shuya Chiba
    Ryota Matsubara
    Kenta Ozeki
    Masao Tsugaki
    Graphs and Combinatorics, 2010, 26 : 187 - 205
  • [5] A k-Tree Containing Specified Vertices
    Chiba, Shuya
    Matsubara, Ryota
    Ozeki, Kenta
    Tsugaki, Masao
    GRAPHS AND COMBINATORICS, 2010, 26 (02) : 187 - 205
  • [6] On a k-tree containing specified leaves in a graph
    Matsuda, Haruhide
    Matsumura, Hajime
    GRAPHS AND COMBINATORICS, 2006, 22 (03) : 371 - 381
  • [7] On a k-Tree Containing Specified Leaves in a Graph
    Haruhide Matsuda
    Hajime Matsumura
    Graphs and Combinatorics, 2006, 22 : 371 - 381
  • [8] ON A SPANNING k-TREE IN WHICH SPECIFIED VERTICES HAVE DEGREE LESS THAN k
    Matsumura, Hajime
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2015, 35 (01) : 191 - 196
  • [9] ON THE SPANNING K-TREE PROBLEM
    CAI, LZ
    MAFFRAY, F
    DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 139 - 156
  • [10] Heuristics for Minimum Spanning k-tree Problem
    Shangin, Roman E.
    Pardalos, Panos M.
    2ND INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT, ITQM 2014, 2014, 31 : 1074 - 1083
12345