广义Petersen图的控制数——当m是偶数时P(m,2)的控制数  

Domination Number of Generalized Petersen Graphs

作　　者：齐登记[1] 

机构地区：[1]青岛科技大学数理系,山东青岛266061

出　　处：《青岛科技大学学报（自然科学版）》2005年第2期181-183,共3页Journal of Qingdao University of Science and Technology:Natural Science Edition

摘　　要：广义Petersen图是一类重要的并被广泛研究的互联网络.本文得到了广义Pe tersen图P(m,2)当m是偶数时的控制数的一个可达上界.Generalized Petersen graphs are an important class of commonly used inter-connection networks and have been studied by various researchers. An upper bound of domination number of generalized Petersen graphs P(m,2) (m is even) is obtained in this paper .

关 键 词：广义PETERSEN图 控制集 无赘集 

分 类 号：O157.5[理学—数学]