| _version_ | 1866902164874461184 |
|---|---|
| author | T. C. Adefokun O. L. Ogundipe D. O. Ajayi |
| author_facet | T. C. Adefokun O. L. Ogundipe D. O. Ajayi |
| contents | <div><span>For a simple undirected graph </span><span>G</span><span>, an induced matching in </span><span>G </span><span>is a set of edges </span><span>M </span><span>no two of </span><span>which have common vertex or are joined by an edge of </span><span>G </span><span>in the edge set </span><span>E</span><span>(</span><span>G</span><span>) </span><span>of </span><span>G</span><span>. Denoted </span><span>by </span><span>im(</span><span>G</span><span>)</span><span>, the maximum cardinal number of </span><span>M </span><span>is known as the induced matching number of </span><span>G</span><span>. In this work, we probe </span><span>im(</span><span>G</span><span>) </span><span>where </span><span>G </span><span>= </span><span>G</span><span>m,n</span><span>, which is the stacked-book graph obtained </span><span>by the Cartesian product of the star graph </span><span>S</span><span>m </span><span>and path </span><span>P</span><span>n</span><span>.</span></div> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_14710725 |
| institution | Zenodo |
| language | |
| publishDate | 2024 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | On Induced Matching Numbers of Stacked-Book Graphs T. C. Adefokun O. L. Ogundipe D. O. Ajayi Stacked-Book Graphs Maximum Induced Matching Number Cartesian Product of Graphs <div><span>For a simple undirected graph </span><span>G</span><span>, an induced matching in </span><span>G </span><span>is a set of edges </span><span>M </span><span>no two of </span><span>which have common vertex or are joined by an edge of </span><span>G </span><span>in the edge set </span><span>E</span><span>(</span><span>G</span><span>) </span><span>of </span><span>G</span><span>. Denoted </span><span>by </span><span>im(</span><span>G</span><span>)</span><span>, the maximum cardinal number of </span><span>M </span><span>is known as the induced matching number of </span><span>G</span><span>. In this work, we probe </span><span>im(</span><span>G</span><span>) </span><span>where </span><span>G </span><span>= </span><span>G</span><span>m,n</span><span>, which is the stacked-book graph obtained </span><span>by the Cartesian product of the star graph </span><span>S</span><span>m </span><span>and path </span><span>P</span><span>n</span><span>.</span></div> |
| title | On Induced Matching Numbers of Stacked-Book Graphs |
| topic | Stacked-Book Graphs Maximum Induced Matching Number Cartesian Product of Graphs |
| url | https://doi.org/10.5281/zenodo.14710725 |