On Induced Matching Numbers of Stacked-Book Graphs

Simple item page
dc.contributor.authorAdefokun Tayo Charles
dc.contributor.authorOgundipe Opeoluwa Lawrence
dc.contributor.authorAjayi Deborah Olayide
dc.date.accessioned2025-06-25T12:20:09Z
dc.date.available2025-06-25T12:20:09Z
dc.date.issued2024
dc.description.abstractFor a simple undirected graph G, an induced matching in G is a set of edges M no two of which have common vertex or are joined by an edge of G in the edge set E(G) of G. Denoted by im(G), the maximum cardinal number of M is known as the induced matching number of G. In this work, we probe im(G) where G = Gm,n, which is the stacked-book graph obtained by the Cartesian product of the star graph Sm and path Pn.
dc.identifier.citationAdefokun, T. C., Ogundipe, O. L. and Ajayi, D. O. (2024). On Induced Matching Numbers of Stacked-Book Graphs. International Journal of Mathematical Sciences and Optimization: Theory and Applications. 10(4); 114 - 120.
dc.identifier.urihttps://repository.crawforduniversity.edu.ng/handle/123456789/321
dc.language.isoen
dc.publisherInternational Journal of Mathematical Sciences and Optimization: Theory and Applications
dc.relation.ispartofseries10; 4
dc.titleOn Induced Matching Numbers of Stacked-Book Graphs
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
On Induced Matching Numbers of Stacked-Book Graphs.pdf
Size:
423.78 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