Opening book details…
Can I read On Covering Vertices of a Graph by Trees on EtoBox?
On Covering Vertices of a Graph by Trees by P. Horak; K. McAvaney is a Computer Science article available to read on EtoBox.
What is On Covering Vertices of a Graph by Trees about?
The purpose of this paper is to initiate study of the following problem: Let G be a graph, and k 1. Determine the minimum number s of trees T 1 , . . . , T s , (T i ) k, i = 1, . . . , s, covering all vertices of G. We conjecture: Let G be a connected graph, and k 2. Then the vertices of G can be covered by s n-(k-1)+1 edge-disjoint trees of maximum degree k. As a support for the conjecture we prove the statement for some values of and k.
Who reads On Covering Vertices of a Graph by Trees?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- P. Horak; K. McAvaney
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 2008
- Language
- EN
- Field
- Computer Science (Physical Sciences)