Title : ( On a Conjecture about the Saturation Number of Corona Product of Graphs )
Authors: Mostafa Tavakoli ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
Let $G=(V_G, E_G)$ be a simple and connected graph. A set $M\\\\subseteq 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\\\\circ H)$ where $H$ is a randomly matchable graph.
Keywords
, maximal matching, corona product, saturation number.
@article{paperid:1091572,
author = {Tavakoli, Mostafa},
title = {On a Conjecture about the Saturation Number of Corona Product of Graphs},
journal = {Journal of Mathematics},
year = {2022},
volume = {2022},
number = {1},
month = {September},
issn = {2314-4629},
pages = {1--3},
numpages = {2},
keywords = {maximal matching; corona product; saturation number.},
}
%0 Journal Article
%T On a Conjecture about the Saturation Number of Corona Product of Graphs
%A Tavakoli, Mostafa
%J Journal of Mathematics
%@ 2314-4629
%D 2022
