| PACKING A TREE OF ORDER p WITH A （p,p＋1）—GRAPH |
| |
| 作者姓名： | WANGMin LIGuojun |
| |
| 作者单位： | [1]DepartmentofMathematics,YantaiUniversity,Yantai264005,China [2]DepartmentofMathematics,ShandongUniversity,Jinan250100,China |
| |
| 基金项目： | This research is partially supported by the National Natural Science Foundation of China(19971053). |
| |
| 摘 要： | 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.
|
| 关 键 词： | 树图 简单图 匹配 （p p＋1）图 |
PACKING A TREE OF ORDER p WITH A (p,p+1)-GRAPH |
| |
| WANGMin LIGuojun.PACKING A TREE OF ORDER p WITH A (p,p+1)-GRAPH[J].Journal of Systems Science and Complexity,2003,16(1):122-132. |
| |
| Authors: | WANG Min |
| |
| Abstract: | 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. |
| |
| Keywords: | Packing tree (p p+ 1)-graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
