Covering the edge set of a directed graph with trees
Covering the edge set of a directed graph with trees
复制标题
用树覆盖有向图的边集
DOI：
10.1016/0012-365x(78)90174-7
复制
发表时间：
1978
期刊：
影响因子：
--
通讯作者：
K. Vidyasankar
中科院分区：
文献类型：
--
作者：
K. Vidyasankar
设G是一个有限有向图，以及G中的一个指定顶点，使得G的边集可以被以ats为根的跨越树状体的集合覆盖。本文建立了此类集合的最小基数。还表明，当G是无环时，me等于G中顶点无价数的最大值。
LetGbe a finite directed graph, andsa specified vertex inG, such that the edge set ofGcan be covered with a collection of spanning arborescences rooted ats. The paper establishes the cardinalitymof a minimum such collection. It is also shown that whenGis acyclic,mequals the maximum of the invalences of vertices inG.