On a Conjecture about the Saturation Number of Corona Product of Graphs. (28th September 2022)

• Record Type: Journal Article
• Authors: Tavakoli, Mostafa
• Other Names: Hong Shaofang Academic Editor.
• Is Part Of: Journal of mathematics. Volume 2022(2022)
• Publication Date: 2022-09-28
• Subjects: Mathematics -- Periodicals; Mathematics; Periodicals; 510
• DOI: 10.1155/2022/3375246
• Languages: English
• ISSNs: 2314-4629

Abstract

Abstract : Let G = V G, E G be a simple and connected graph. A set M ⊆ E G 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 s G ∘ H where H is a randomly matchable graph.