| K—可覆盖冠状系统的实现 |
| |
| 引用本文： | 陈荣期,黄海燕.K—可覆盖冠状系统的实现[J].新疆大学学报(理工版),1992,9(1):16-21. |
| |
| 作者姓名： | 陈荣期 黄海燕 |
| |
| 作者单位： | 福州大学财经学院(陈荣斯)，福州大学数学系(黄海燕) |
| |
| 摘 要： | 一个冠状系统(coroniod system)G被称作是k-可覆盖的,如果对任何k个互相邻接的六角形,从G中删去这k个六角形以及相关联的边后得到的子图至少含有一个完美匹配,本文得到一个简捷的方法,由此可以确定是否存在k-可覆盖的冠状系统,并且确定出了这些k-可覆盖的冠状系统。
|
| 关 键 词： | 冠状系统 K－可覆盖 完美匹配 |
REALIZATION OF K-COVERABLE CORONOID SYSTEMS |
| |
| Chen Rongsi,Huang Haiyan College of Finance and Economics,Fuzhou University Lin Kerong.REALIZATION OF K-COVERABLE CORONOID SYSTEMS[J].Journal of Xinjiang University(Science & Engineering),1992,9(1):16-21. |
| |
| Authors: | Chen Rongsi Huang Haiyan College of Finance and Economics Fuzhou University Lin Kerong |
| |
| Institution: | Chen Rongsi,Huang Haiyan College of Finance and Economics,Fuzhou University Lin Kerong Department of Mathematics,Fuzhou University |
| |
| Abstract: | A coronoid system(CS)G is said to be k-coverable if for any k,mutually disjunct hexagons the sub-
graph obtained from G by deleting these k hexagons together with their incident edges has at least one perfect
matching.In this paper a simple method is developed which allows to determine whether or not there exist k
-covetable CSs with exactly h hexagons and to find all such k-coverable CSs. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
