Spanning trees with pairwise nonadjacent endvertices
Discrete Mathematics
On spanning trees with restricted degrees
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
Let G = (V, E) be a connected graph and X be a vertex subset of G. Let f be a mapping from X to the set of natural numbers such that f(x) ≥ 2 for all x σ X. A degree restricted spanning tree is a spanning tree T of G such that f(x) ≤ degT(x) for all x σ X, where degT(x) denotes the degree of a vertex x in T. In this paper, we show that the decision problem "whether there exists a degree restricted spanning tree in G" is NP-complete. We also give a restricted proof of a conjecture, provided by Kaneko and Yoshimoto, on the existence of such a spanning tree in general graphs. Finally, we present a polynomial-time algorithm to find a degree restricted spanning tree of a graph satisfying the conditions presented in the restricted proof of the conjecture.