On Induced Matching Numbers of Stacked-Book Graphs
Loading...
Date
2024
Journal Title
Journal ISSN
Volume Title
Publisher
International Journal of Mathematical Sciences and Optimization: Theory and Applications
Abstract
For 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.
Description
Keywords
Citation
Adefokun, 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.