中文摘要：

Let G1 and G2 be two graphs of the same order,If G1 is isomorphic to a spanning subgraph of the complement of G2,then we say that G1 and G2 are packable.A graph G is called a (p,m)-graph if G has p vertices and m edges.The main purpose of this paper is to present a necessary and sufficient condition for a tree of order p and a (p,p+1)-graph to be packable.

英文摘要：

Let G1 and G2 be two graphs of the same order. If G1 is isomorphic to a spanning subgraph of the complement of G2, then we say that G1 and G2 are packable. A graph G is called a (p, m)-graph if G has p vertices and m edges. The main purpose of this paper is to present a necessary and sufficient condition for a tree of order p and a (p, p + 1)-graph to be packable.