On a Conjecture about the Saturation Number of Corona Product of Graphs
Let G=VG,EG be a simple and connected graph. A set M⊆EG is called a matching if no two edges of M have a common endpoint. A matching M is maximal if it cannot be extended to a larger matching in G. The smallest size of a maximal matching is called the saturation number of G. In this paper, we confir...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/3375246 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849686576588652544 |
|---|---|
| author | Mostafa Tavakoli |
| author_facet | Mostafa Tavakoli |
| author_sort | Mostafa Tavakoli |
| collection | DOAJ |
| description | Let G=VG,EG be a simple and connected graph. A set M⊆EG is called a matching if no two edges of M have a common endpoint. A matching M is maximal if it cannot be extended to a larger matching in G. The smallest size of a maximal matching is called the saturation number of G. In this paper, we confirm a conjecture of Alikhani and Soltani about the saturation number of corona product of graphs. We also present the exact value of sG∘H where H is a randomly matchable graph. |
| format | Article |
| id | doaj-art-bf98adf12bd149c3aa5c24d531dcd25d |
| institution | DOAJ |
| issn | 2314-4785 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-bf98adf12bd149c3aa5c24d531dcd25d2025-08-20T03:22:39ZengWileyJournal of Mathematics2314-47852022-01-01202210.1155/2022/3375246On a Conjecture about the Saturation Number of Corona Product of GraphsMostafa Tavakoli0Department of Applied MathematicsLet G=VG,EG be a simple and connected graph. A set M⊆EG is called a matching if no two edges of M have a common endpoint. A matching M is maximal if it cannot be extended to a larger matching in G. The smallest size of a maximal matching is called the saturation number of G. In this paper, we confirm a conjecture of Alikhani and Soltani about the saturation number of corona product of graphs. We also present the exact value of sG∘H where H is a randomly matchable graph.http://dx.doi.org/10.1155/2022/3375246 |
| spellingShingle | Mostafa Tavakoli On a Conjecture about the Saturation Number of Corona Product of Graphs Journal of Mathematics |
| title | On a Conjecture about the Saturation Number of Corona Product of Graphs |
| title_full | On a Conjecture about the Saturation Number of Corona Product of Graphs |
| title_fullStr | On a Conjecture about the Saturation Number of Corona Product of Graphs |
| title_full_unstemmed | On a Conjecture about the Saturation Number of Corona Product of Graphs |
| title_short | On a Conjecture about the Saturation Number of Corona Product of Graphs |
| title_sort | on a conjecture about the saturation number of corona product of graphs |
| url | http://dx.doi.org/10.1155/2022/3375246 |
| work_keys_str_mv | AT mostafatavakoli onaconjectureaboutthesaturationnumberofcoronaproductofgraphs |