包装两个边数总和为2n-2的n阶图对(II)——{(p,p-2),(p,p)}图对包装
Packing a Pair of n-Order Graphs with the Sum of Edges 2n-2 (II)—Packing of (p,p-2)-Graphs and (p,p)-Graphs

图的包装问题是图论近几十年来较关注的问题之一。在理论上，它为研究图论中一些经典问题提供新的方式。在应用上，对计算机、生物信息、电路设计等领域的发展有举足轻重的意义，其在对离散系统和网络系统的空间和容量利用等方面具有实际性帮助。本文给出边数总和为2n？2的n阶图对{(p,p？2),(p,p)}包装的充要条件。
The packing problem of graphs is one of the most concerned problems in graph theory in recent decades. Theoretically, it provides a new way to study some classical problems in graph theory. In terms of application, it is of great significance to the development of the computer, biological information and circuit design field, and is of practical help to the space and capacity utilization of discrete systems and network systems. In this paper, it has been proved that the necessary and sufficient conditions for packing pairs of(p,p？2)-graphs and(p,p)-graphs of the n order whose sum of edges is 2n？2.