Spanning Trees: A Survey

被引：82
|
作者：
Ozeki, Kenta [2 ]
Yamashita, Tomoki [1 ]
机构：
[1] Kitasato Univ, Coll Liberal Arts & Sci, Minami Ku, Kanagawa 2520373, Japan
[2] Natl Inst Informat, Chiyoda Ku, Tokyo 1018430, Japan
来源：
GRAPHS AND COMBINATORICS | 2011年 / 27卷 / 01期
关键词：
Spanning trees; k-Trees; k-Ended trees; Branch vertices; k-Leaf connected; DEGREE-PRESERVING VERTICES; MINIMUM DEGREE CONDITION; NETWORK DESIGN PROBLEM; LINEAR-TIME ALGORITHM; MAXIMUM LEAF PROBLEMS; CUBIC GRAPHS; INDEPENDENT TREES; CIRCULANT GRAPHS; STEINER TREES; APPROXIMATION ALGORITHMS;
D O I：
10.1007/s00373-010-0973-2
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we give a survey of spanning trees. We mainly deal with spanning trees having some particular properties concerning a hamiltonian properties, for example, spanning trees with bounded degree, with bounded number of leaves, or with bounded number of branch vertices. Moreover, we also study spanning trees with some other properties, motivated from optimization aspects or application for some problems.
引用
收藏
页码：1 / 26
页数：26
相关论文
共 50 条
  • [21] On Steiner trees and minimum spanning trees in hypergraphs
    Polzin, T
    Daneshmand, SV
    OPERATIONS RESEARCH LETTERS, 2003, 31 (01) : 12 - 20
  • [22] Spanning trees and spanning closed walks with small degrees
    Hasanvand, Morteza
    DISCRETE MATHEMATICS, 2022, 345 (10)
  • [23] Spanning trees and spanning Eulerian subgraphs with small degrees
    Hasanvand, Morteza
    DISCRETE MATHEMATICS, 2015, 338 (08) : 1317 - 1321
  • [24] Rooted Spanning Trees in Tournaments
    Xiaoyun Lu
    Da-Wei Wang
    Jiaofeng Pan
    C. K. Wong
    Graphs and Combinatorics, 2000, 16 : 411 - 427
  • [25] Spanning trees and optimization problems
    Silva, D
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2006, 57 (02) : 227 - 228
  • [26] Spanning trees in dense graphs
    Komlós, J
    Sárközy, GN
    Szemerédi, E
    COMBINATORICS PROBABILITY & COMPUTING, 2001, 10 (05): : 397 - 416
  • [27] ON THE DIAMETERS OF SPANNING-TREES
    SANKARAN, V
    KRISHNAMOORTHY, V
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1985, 32 (10): : 1060 - 1062
  • [28] The number of spanning trees in a superprism
    Bogdanowicz, Zbigniew R.
    DISCRETE MATHEMATICS LETTERS, 2024, 13 : 66 - 73
  • [29] Spanning trees with many leaves
    Karpov D.V.
    Journal of Mathematical Sciences, 2011, 179 (5) : 616 - 620
  • [30] Leafy spanning trees in hypercubes
    Duckworth, W
    Dunne, PE
    Gibbons, AM
    Zito, M
    APPLIED MATHEMATICS LETTERS, 2001, 14 (07) : 801 - 804
12345