For k≥2, a graph G is said to be k-leaf connected if |G|>k and for each subset S of V(G) with |S|=k, G has a spanning tree T with precisely S as the set of endvertices of T. This property is a general concept of Hamiltonian-connected. This paper gives a Fan-type condition for graphs to be k-leaf-connected.
- Fan-type degree condition
- Spanning tree
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics