PACKING A TREE OF ORDER p WITH A (p,p+1)-GRAPH

查看全文 作　　者：[1]WANGMin;[2]LIGuojun

机构地区：[1]DepartmentofMathematics,YantaiUniversity,Yantai264005,China;[2]DepartmentofMathematics,ShandongUniversity,Jinan250100,China

出　　处：《Journal of Systems Science & Complexity》索引2003年第16卷第1期,共11页

基　　金：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)图

相关文献

参考文献（6）
引证文献（12）
耦合文献（12）

参考文献(6)

引证文献(12)

耦合文献(12)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

PACKING A TREE OF ORDER p WITH A (p,p+1)-GRAPH

参考文献(6)

引证文献(12)

耦合文献(12)

用户提示