On the Independence Number of the Generalized Petersen Graph P(n,k)

摘要：

Let G=(V(G),E(G)) be a simple finite undirected graph. A set S(С-)V(G) is an independent set if no two vertices of 5 are adjacent. The independence number α(G) is the maximum cardinality of an independent set in G. In this paper, we investigate the independence number of generalized Petersen graph, and give the exact values of P(n, k) for k=1,2,3,5.

关键词： Operations Research Graph Theory Independent set Independence number Generalized Petersen graph

作者: Lian-Cheng Xu Yuan-Sheng Yang Zun-Quan Xia Jing-Xi Tian

作者单位: Department of Applied Mathematica, Dalian University of Technology, Dalian 116024 School of Informat Department of Computer Science and Technology, Dalian University of Technology,Dalian 116024 Department of Applied Mathematica, Dalian University of Technology, Dalian 116024

会议类型: 国际会议

会议名称: The 8th International Symposium on Operations Research and Its Applications(第八届运筹及其应用国际专题讨论会 ISORA09)

会议地点: 张家界

会议语种:英文

页码: 40-45

在线出版日期: 2009-09-20（万方平台首次上网日期，不代表论文的发表时间）