Adefokun Tayo CharlesAjayi Deborah Olayide2025-06-252025-06-252016Adefokun, T. C. and Ajayi, D. O. (2016). On Maximum Induced Matching Numbers of Special Grids. arXiv preprint arXiv. 16(11).https://repository.crawforduniversity.edu.ng/handle/123456789/318A subset M of the edge set of a graph G is an induced matching of G if given any two e1, e2 ∈ M, none of the vertices on e1 is adjacent to any of the vertices on e2. Suppose that MIMG, a positive integer, is the largest possible size of M in G, then, M is the maximum induced matching, MIM, of G and MIMG is the maximum induced matching number of G. We obtain some upper bounds for the maximum induced matching numbers of some specific gridsenArticle