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 条

[31] Fuzzy Degree-Constrained Minimum Spanning Tree problem
Lu, Yiwen
Proceedings of the Fifth International Conference on Information and Management Sciences, 2006, 5 : 578 - 584
[32] Forbidden subgraphs restricting vertices of degree two in a spanning tree
Furuya, Michitaka
Tsuchiya, Shoichi
ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (03):
[33] Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Biniaz, Ahmad
PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 826 - 836
[34] EDGE DEGREE CONDITIONS FOR DOMINATING AND SPANNING CLOSED TRAILS
Tian, Tao
Broersma, Hajo J.
Xiong, Liming
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (01) : 363 - 381
[35] Stable set reformulations for the degree preserving spanning tree problem
Lucena, Abilio
da Cunha, Alexandre Salles
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 319 (01) : 50 - 61
[36] Degree stability of a minimum spanning tree of price return and volatility
Miccichè, S
Bonanno, G
Lillo, F
Mantegna, RN
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2003, 324 (1-2) : 66 - 73
[37] A new encoding for the degree constrained minimum spanning tree problem
Soak, SM
Corne, D
Ahn, BH
KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 1, PROCEEDINGS, 2004, 3213 : 952 - 958
[38] A moderately exponential time algorithm for full degree spanning tree
Gaspers, Serge
Saurabh, Saket
Stepanov, Alexey A.
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2008, 4978 : 479 - 489
[39] A spanning tree approach to social network sampling with degree constraints
Rezvanian, Alireza
Vahidipour, S. Mehdi
Jalali, Zeinab S.
SOCIAL NETWORK ANALYSIS AND MINING, 2024, 14 (01)
[40] Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Ahmad Biniaz
Discrete & Computational Geometry, 2022, 67 : 311 - 327

← 1 2 3 4 5 →