IDEAS home Printed from https://ideas.repec.org/a/wly/jjmath/v2022y2022i1n3375246.html

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

Author

Listed:
  • Mostafa Tavakoli

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 s(G∘H) where H is a randomly matchable graph.

Suggested Citation

  • Mostafa Tavakoli, 2022. "On a Conjecture about the Saturation Number of Corona Product of Graphs," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:jjmath:v:2022:y:2022:i:1:n:3375246
    DOI: 10.1155/2022/3375246
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/3375246
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/3375246?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Klavžar, Sandi & Tavakoli, Mostafa, 2021. "Dominated and dominator colorings over (edge) corona and hierarchical products," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ashraf ELrokh & Mohammed M. Ali Al-Shamiri & Shokry Nada & Atef Abd El-hay, 2022. "Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    2. Yangyang Zhou & Dongyang Zhao & Mingyuan Ma & Jin Xu, 2022. "Domination Coloring of Graphs," Mathematics, MDPI, vol. 10(6), pages 1-12, March.
    3. Ashraf ELrokh & Mohammed M. Ali Al-Shamiri & Atef Abd El-hay, 2022. "A Novel Problem to Solve the Logically Labeling of Corona between Paths and Cycles," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    4. Minhui Li & Shumin Zhang & Chengfu Ye, 2023. "Dominated coloring in product graphs," Journal of Combinatorial Optimization, Springer, vol. 46(4), pages 1-11, November.
    5. Shang, Yilun, 2022. "Sombor index and degree-related properties of simplicial networks," Applied Mathematics and Computation, Elsevier, vol. 419(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jjmath:v:2022:y:2022:i:1:n:3375246. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/1469 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.