2022/09/22 by Adefokun, Tyao Charles, Ogundipe, Opeoluwa Lawrence, Ajayi, Deborah Olayide
Computer Science · Mathematics · #05C10 #05C35 #05C70 #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2209.10855
openalex publication_date 2022/09/22 · openalex created_date 2022/09/25 · openalex updated_date 2026/07/28
Suppose that G is a simple, undirected graph. An induced matching in G is a set of edges M in the edge set E(G) of G such that if e1, e2 in M, then no endpoint v1, v2 of e1 and e2 respectively is incident to any edge ek in E(G) such that ek is incident to any edge in M. 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.