On low bound of degree sequences of spanning trees in K-edge-connected graphs
文献类型：期刊论文
| 作者 | Liu, ZH; Xu, BG |
| 刊名 | JOURNAL OF GRAPH THEORY
 |
| 出版日期 | 1998-06-01 |
| 卷号 | 28期号:2页码:87-95 |
| 关键词 | d(k)-tree d(k)-full vertex out-directed tree spanning tree DFS algorithm |
| ISSN号 | 0364-9024 |
| 英文摘要 | A graph G = (V, E) is k-edge-connected if for any subset E' subset of or equal to E, \E'\ < k, G - E' is connected. A d(k)-tree T of a connected graph G = (V, E) is a spanning tree satisfying that For All v is an element of V, d(T)(v) less than or equal to [d(v)+k-1/k] + alpha, where [.] is a lower integer form and a depends on k. We show that every k-edge-connected graph with k greater than or equal to 2, has a d(k)-tree, and alpha = 1 for k = 2, alpha = 2 for k greater than or equal to 3. (C) 1998 John Wiley & Sons, Inc. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000073607800002 |
| 出版者 | JOHN WILEY & SONS INC |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/13532]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Liu, ZH |
| 作者单位 | Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Liu, ZH,Xu, BG. On low bound of degree sequences of spanning trees in K-edge-connected graphs[J]. JOURNAL OF GRAPH THEORY,1998,28(2):87-95. |
| APA | Liu, ZH,&Xu, BG.(1998).On low bound of degree sequences of spanning trees in K-edge-connected graphs.JOURNAL OF GRAPH THEORY,28(2),87-95. |
| MLA | Liu, ZH,et al."On low bound of degree sequences of spanning trees in K-edge-connected graphs".JOURNAL OF GRAPH THEORY 28.2(1998):87-95. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。