On a Conjecture about the Saturation Number of Corona Product of Graphs

Mostafa Tavakoli and Shaofang Hong

Journal of Mathematics, 2022, vol. 2022, 1-3

Abstract: 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.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/3375246.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/3375246.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:3375246

DOI: 10.1155/2022/3375246

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().