There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)

摘要

A spanning spider for a graph G is a spanning tree T of G with at most one vertex having degree three or more in T. In this paper we give density criteria for the existence of spanning spiders in graphs. We constructively prove the following result: Given a graph G with n vertices, if the degree sum of any independent triple of vertices is at least n - 1, then there exists a spanning spider in G. We also study the case of bipartite graphs and give density conditions for the existence of a spanning spider in a bipartite graph. All our proofs are constructive and imply the existence of polynomial time algorithms to construct the spanning spiders. The interest in the existence of spanning spiders originally arises in the realm of multicasting in optical networks. However, the graph theoretical problems discussed here are interesting in their own right.