Refinements of degree conditions for the existence of a spanning tree without small degree stems

被引：0

作者：

Furuya, Michitaka ^{[1
]}

Saito, Akira ^{[2
]}

Tsuchiya, Shoichi ^{[3
]}

机构：

[1] Kitasato Univ, Coll Liberal Arts & Sci, Kitasato 1-15-1,Minami Ku, Sagamihara, Kanagawa 2520373, Japan

[2] Nihon Univ, Dept Informat Sci, Sakurajosui 3-25-40,Setagaya Ku, Tokyo 1568550, Japan

[3] Senshu Univ, Sch Network & Informat, 2-1-1 Higashimita,Tama Ku, Kawasaki, Kanagawa 2148580, Japan

来源：

DISCRETE MATHEMATICS | 2025年 / 348卷 / 02期

关键词：

Homeomorphically irreducible spanning; tree (HIST); Minimum degree; Degree-sum; 2; k; ST;

D O I：

10.1016/j.disc.2024.114307

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A spanning tree of a graph without vertices of degree 2 is called a homeomorphically irreducible spanning tree (or a HIST) of the graph. Albertson et al. (1990) [1] gave a minimum degree condition for the existence of a HIST, and recently, Ito and Tsuchiya (2022) [11] found a sharp degree-sum condition for the existence of a HIST. In this paper, we refine these results, and extend the first one to a spanning tree in which no vertex other than the endvertices has small degree. (c) 2024 Published by Elsevier B.V.

引用

页数：11

共 50 条

[21] Comparison of algorithms for the Degree Constrained Minimum Spanning Tree
Krishnamoorthy, M
Ernst, AT
Sharaiha, YM
JOURNAL OF HEURISTICS, 2001, 7 (06) : 587 - 611
[22] A multiperiod degree constrained minimal spanning tree problem
Kawatra, R
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 143 (01) : 53 - 63
[23] On the Directed Degree-Preserving Spanning Tree Problem
Lokshtanov, Daniel
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath
PARAMETERIZED AND EXACT COMPUTATION, 2009, 5917 : 276 - +
[24] A new tree encoding for the degree-constrained spanning tree problem
Zhou, Gengui
Meng, Zhiqing
Cao, Zhenyu
Cao, Jian
CIS: 2007 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PROCEEDINGS, 2007, : 85 - +
[25] Existence of a spanning tree having small diameter
Egawa, Yoshimi
Furuya, Michitaka
Matsumura, Hajime
DISCRETE MATHEMATICS, 2021, 344 (11)
[26] Self-stabilizing minimum degree spanning tree within one from the optimal degree
Blin, Lelia
Potop-Butucaru, Maria Gradinariu
Rovedakis, Stephane
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2011, 71 (03) : 438 - 449
[27] Spanning trees without adjacent vertices of degree 2
Lyngsie, Kasper Szabo
Merker, Martin
DISCRETE MATHEMATICS, 2019, 342 (12)
[28] Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Biniaz, Ahmad
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 826 - 836
[29] Genetic Programming Based Degree Constrained Spanning Tree Extraction
Babar, Zaheer
Waqas, Muhammad
Halim, Zahid
Islam, Muhammad Arshad
2013 EIGHTH INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION MANAGEMENT (ICDIM), 2013, : 241 - 246
[30] Probabilistic analysis of the degree bounded minimum spanning tree problem
Srivastav, Anand
Werth, Soeren
FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 497 - 507

← 1 2 3 4 5 →