3-Restricted arc connectivity of digraphs
文献类型：期刊论文
| 作者 | Lin, Shangwei1,2; Jin, Ya'nan1; Li, Chunfang1 |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2017-10-01 |
| 卷号 | 340期号:10页码:2341-2348 |
| 关键词 | Network Digraph Connectivity Minimum degree |
| ISSN号 | 0012-365X |
| DOI | 10.1016/j.disc.2017.05.004 |
| 英文摘要 | The k-restricted arc connectivity of digraphs is a common generalization of the arc connectivity and the restricted arc connectivity. An arc subset S of a strong digraph D is a k-restricted arc cut if D - S has a strong component D' with order at least k such that D - V(D') contains a connected subdigraph with order at least k. The k-restricted arc connectivity lambda(k)(D) of a digraph D is the minimum cardinality over all k-restricted arc cuts of D. Let D be a strong digraph with order n >= 6 and minimum degree delta(D). In this paper, we first show that lambda(3)(D) exists if delta(D) >= 3 and, furthermore, lambda(3) (D) <= xi(3)(D) if delta(D) >= 4, where xi(3)(D) is the minimum 3-degree of D. Next, we prove that lambda(3)(D) = xi(3)(D) if delta(D) >= n+3/2 Finally, we give examples showing that these results are best possible in some sense. (C) 2017 Elsevier B.V. All rights reserved. |
| 资助项目 | National Natural Science Foundation of China[61202017] ; Postdoctoral Science Foundation of China[2012M510579] |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000407182200002 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/26308]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Lin, Shangwei |
| 作者单位 | 1.Shanxi Univ, Sch Math Sci, Taiyuan 030006, Shanxi, Peoples R China 2.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Lin, Shangwei,Jin, Ya'nan,Li, Chunfang. 3-Restricted arc connectivity of digraphs[J]. DISCRETE MATHEMATICS,2017,340(10):2341-2348. |
| APA | Lin, Shangwei,Jin, Ya'nan,&Li, Chunfang.(2017).3-Restricted arc connectivity of digraphs.DISCRETE MATHEMATICS,340(10),2341-2348. |
| MLA | Lin, Shangwei,et al."3-Restricted arc connectivity of digraphs".DISCRETE MATHEMATICS 340.10(2017):2341-2348. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。