Vertices of degree k in a minimally k-edge-connected digraph
文献类型：期刊论文
| 作者 | Yuan, XD; Cai, MC |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2000-05-06 |
| 卷号 | 218期号:1-3页码:293-298 |
| 关键词 | digraph indegree outdegree k-edge-connected k-cut crossing-free terminal |
| ISSN号 | 0012-365X |
| 英文摘要 | Let k be a positive integer and D = (V,E) be a minimally k-edge-connected simple digraph. For a vertex x is an element of V(D), its outdegree delta(+)(x) (indegree delta(-)(x)) is the number of edges leaving (entering) x. Let u(+) (D) (resp. u(+/-) (D) and u(-) (D)) denote the number of vertices x in D such that delta(+)(x) = k < delta(-)(x) (resp. delta(+)(x) = delta(-)(x) = k and delta(+)(x) > k = delta(-)(x)). In this paper we prove that u(+) (D) + 2u(+/-) (D) + u(-) (D) greater than or equal to 2k + 2, which was conjectured by Mader (Combinatorics 2 (1996) 423-449). We also present a lower bound on u(+) (D) + u(+/-) (D) + u(-) (D) when \D\ greater than or equal to 4k - 1. (C) 2000 Elsevier Science B.V. All rights reserved. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000086873700024 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/15445]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Cai, MC |
| 作者单位 | Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Yuan, XD,Cai, MC. Vertices of degree k in a minimally k-edge-connected digraph[J]. DISCRETE MATHEMATICS,2000,218(1-3):293-298. |
| APA | Yuan, XD,&Cai, MC.(2000).Vertices of degree k in a minimally k-edge-connected digraph.DISCRETE MATHEMATICS,218(1-3),293-298. |
| MLA | Yuan, XD,et al."Vertices of degree k in a minimally k-edge-connected digraph".DISCRETE MATHEMATICS 218.1-3(2000):293-298. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。