| （P,P）图的可嵌性定理 |
| |
| 引用本文： | 王敏,张传惠.（P,P）图的可嵌性定理[J].烟台大学学报(自然科学与工程版),1991(1):13-17. |
| |
| 作者姓名： | 王敏 张传惠 |
| |
| 作者单位： | 烟台大学
(王敏)，烟台大学(张传惠) |
| |
| 摘 要： | 设G是一个简单无向图,称G是(P,P)图,如果|E(G)|=|v(G)|.若G同构于6某个子图,则称G可嵌入6,本文用极其简捷的方法证明了:阶数大于9的(P,P)图可嵌入其补图内的充要条件是G不和图(1)中的任一个图同构。
|
| 关 键 词： | 图 补图 同构置换 嵌入 |
Theorems about Embedding (P,P) Graph in Their Complements |
| |
| Wang Min,Zhang Chuanhui.Theorems about Embedding (P,P) Graph in Their Complements[J].Journal of Yantai University(Natural Science and Engineering edirion),1991(1):13-17. |
| |
| Authors: | Wang Min Zhang Chuanhui |
| |
| Institution: | Yantai University |
| |
| Abstract: | Let G be a simple undirected graph and G be the complement of G. Call G a (P,P) graph, if |E(G) | = | V(G) |. Call G can be embedded into G,if G is isomorphism to a subgraph of G. In this paper,we proved with a very simple method,that a (P,P) graph G with order greater than nine can be embedded into G,if and only if G is isomorphism to none of graphs in figure one. |
| |
| Keywords: | Complementary graph Isomorphism Permutation Embedding |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
