IDEAS home Printed from https://ideas.repec.org/a/hin/jjmath/7336728.html
   My bibliography  Save this article

Domination Numbers of Amalgamations of Cycles at Connected Subgraphs

Author

Listed:
  • Prakassawat Boonmee
  • Jirapa Ma - In
  • Sayan Panma
  • Shaofang Hong

Abstract

A set S of vertices of a graph G is a dominating set of G if every vertex in VG is adjacent to some vertex in S. A minimum dominating set in a graph G is a dominating set of minimum cardinality. The cardinality of a minimum dominating set is called the domination number of G and is denoted by γG. Let G1 and G2 be disjoint graphs, H1 be a subgraph of G1, H2 be a subgraph of G2, and f be an isomorphism from H1 to H2. The amalgamation (the glued graph) of G1 and G2 at H1 and H2 with respect to f is the graph G=G1⊲⊳G2H1≅fH2 obtained by forming the disjoint union of G1 and G2 and then identifying H1 and H2 with respect to f. In this paper, we determine the domination numbers of the amalgamations of two cycles at connected subgraphs.

Suggested Citation

  • Prakassawat Boonmee & Jirapa Ma - In & Sayan Panma & Shaofang Hong, 2022. "Domination Numbers of Amalgamations of Cycles at Connected Subgraphs," Journal of Mathematics, Hindawi, vol. 2022, pages 1-11, January.
    • Handle: RePEc:hin:jjmath:7336728
    DOI: 10.1155/2022/7336728
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2022/7336728.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/jmath/2022/7336728.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/7336728?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
    ---><---

    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:hin:jjmath:7336728. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.