Induced Matching Number of the Plane Grid Graph

作     者：LUXiao-xu PEIMing YAOWei-li ZHOUJu LU Xiao-xu;PEI Ming;YAO Wei-li;Zhou Ju

作者机构：DepartmentofMathematicsZhengzhouUniversityZhengzhou450052China CollegeofMathe-maticsandInformationScienceHenanUniversityKaifeng475001China 

出 版 物：《Chinese Quarterly Journal of Mathematics》 (数学季刊（英文版）)

年 卷 期：2004年第19卷第1期

页      面：95-100页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：induced matching induced matching number α-set 

摘      要：An induced matching M in a graph G is a matching such that V(M) induces a 1-regular subgraph of G. The induced matching number of a graph G, denoted by I M(G), is the maximum number r such that G has an induced matching of r edges. Induced matching number of Pm×Pn is investigated in this paper. The main results are as follows: (1) If at least one of m and n is even, then IM(Pm×Pn=[(mn)/4]. (2) If m is odd, then