| 一类带有纽结分支的边—不交链图 |
| |
| 引用本文： | 任秋萍,王光辉.一类带有纽结分支的边—不交链图[J].黑龙江科技学院学报,2009,19(6):498-500. |
| |
| 作者姓名： | 任秋萍 王光辉 |
| |
| 作者单位： | 1. 黑龙江科技学院,数力系
2. 黑龙江科技学院,计算机与信息工程学院,哈尔滨,150027 |
| |
| 摘 要： | 为进一步探讨边—不交链图的分类,研究其中至少有一个链的分支是非平凡纽结的情形,给出了带有纽结分支的边—不交链图的定义。在给出内在纽结图H0的基础上,利用其与边组成的图形成完全图K7,并采用该方法构造出一类带有纽结分支的边—不交链图H（43）。分析点扩张对H（43）的作用,得到了点扩张的图变换不保持带有纽结分支的边—不交链图的性质这一结论。
|
| 关 键 词： | 空间图 内在纽结图 纽结分支 边—不交链图 |
One of edge-disjoint linked graphs with knotted components |
| |
| REN Qiuping,WANG Guanghui.One of edge-disjoint linked graphs with knotted components[J].Journal of Heilongjiang Institute of Science and Technology,2009,19(6):498-500. |
| |
| Authors: | REN Qiuping WANG Guanghui |
| |
| Institution: | REN Qiuping, WANG Guanghui (1. Department of Mathematics and Mechanics, Heilongjiang Institute of Science and Technology; (2. College of Computer ＆ Information Engineering, Heilongjiang Institute of Science ＆ Technology, Harbin 150027 ,China) |
| |
| Abstract: | This paper is an attempt to further explore the classification of the edge-disjoint linked graphs by studying one branch of the chain case with at least nontrival knot. The paper defines the graph as the edge-disjoint linked graphs with knotted components. On the basis of giving the intrinsically knotted graphs H0, the paper describes the construction of one of the edge-disjoint linked graphs with knotted components H（43 ） by using the method of the graphs K7 formed by the graphs H0 and edges. The analysis of the effect of vertex expansions on H（43 ） leads to the conclusion that the graph altering operations of vertex expansions does not preserve the property of the edge-disjoint linked graphs with knotted components. |
| |
| Keywords: | spatial graphs intrinsically knotted graphs knotted components edge-disjoint linked graphs |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
