Author/Authors :
T. B?hme، نويسنده , , H.J. Broersma، نويسنده , , F. G?bel، نويسنده , , A.V. Kostochka، نويسنده , , M. Stiebitz، نويسنده ,
Abstract :
A spanning tree of a connected graph G is said to be an independency tree if all its endvertices are pairwise nonadjacent in G. We prove that a connected graph G has no independency tree if and only if G is a cycle, a complete graph or a complete bipartite graph the color classes of which have equal cardinality.
