On Maximum Induced Matching Numbers of Special Grids

Simple item page
dc.contributor.authorAdefokun Tayo Charles
dc.contributor.authorAjayi Deborah Olayide
dc.date.accessioned2025-06-25T12:19:28Z
dc.date.available2025-06-25T12:19:28Z
dc.date.issued2016
dc.description.abstractA 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 grids
dc.identifier.citationAdefokun, T. C. and Ajayi, D. O. (2016). On Maximum Induced Matching Numbers of Special Grids. arXiv preprint arXiv. 16(11).
dc.identifier.urihttps://repository.crawforduniversity.edu.ng/handle/123456789/318
dc.language.isoen
dc.publisherarXiv preprint arXiv
dc.relation.ispartofseries16; 11
dc.titleOn Maximum Induced Matching Numbers of Special Grids
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ON MAXIMUM INDUCED MATCHING NUMBERS OF SPECIAL GRIDS.pdf
Size:
208.75 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download
Collections
Scholarly work in the Department of Mathematics & Statistics