Chinese Quarterly Journal of Mathematics ›› 2004, Vol. 19 ›› Issue (1): 95-100.

Previous Articles     Next Articles

Induced Matching Number of the Plane Grid Graph

  

  1.  1.Department of Mathematics, Zhengzhou University, Zhengzhou 450052, China; 2.College of Mathematics and Information Science, Henan University, Kaifeng 475001, China
  • Received:2002-12-04 Online:2004-03-30 Published:2024-03-28
  • About author:LU Xiao-xu(1975-),male,native of Changge,Henan,an assistant of Zhengzhou Institute of Aero- nautical Industry Management,M.A.candidate of Zhenzhou University,engages in comdinatorial optimization and graph theory.

Abstract: 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

Key words: induced ,  , matching;induced ,  , matching ,  , number;a-set

CLC Number: