On vertices of outdegree k in minimally k-arc-connected digraphs

被引：0
|
作者：
Fan, Jun [1 ]
Hu, Xiaomin [1 ]
Yang, Weihua [1 ]
Zhao, Shuang [1 ]
机构：
[1] Taiyuan Univ Technol, Coll Math, Taiyuan 030024, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2025年 / 361卷
关键词：
Digraph; Out-terminal; In-terminal; Tree representation; Minimally k-arc-connected; ANGLES; NUMBER;
D O I：
10.1016/j.dam.2024.11.009
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let k be a positive integer, and D = (V(D), E(D)) be a minimally k-arc-connected simple digraph. Mader conjectured (Combinatorics 2 (1996) 423-449) that there are at least k + 1 vertices of outdegree k in D. In this paper we prove that there are at least four vertices of outdegree k for k >= 3. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页码：465 / 472
页数：8
相关论文
共 50 条
12345