2-EXTENDABILITY OF GENERALIZED PETERSEN GRAPHS~*  

作　　者：孙良 

机构地区：[1]Department of Applied Mathematics, Beijing Institute of Technology, Beijing 100081, PRC

出　　处：《Chinese Science Bulletin》1991年第20期1758-1758,共1页

基　　金：Project supported by the National Natural Science Foundation of China

摘　　要：Definition 1. If any two non-adjacent edges of a connected graph G can be extended to a 1-factor of G, then G is said to be 2-extendable. Definition 2. Let k and n be integers with 1≤k≤n/2. A graph G=（V, E） is said to be the generalized Petersen graph, denoted by GP（n, k ）, if V={u₀, u₁, …, u_n-1, v₀, v₁, …,

关 键 词：Petersen INTEGERS CONNECTED 定阳 ARITHMETIC 心阴 settle 

分 类 号：N[自然科学总论]