IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/5533881.html

Graceful Labeling of some Join Graphs and the Subdivision of Complete Bipartite Graphs

Author

Listed:
  • A. Panpa
  • P. Chaiprasert
  • C. Tisklang

Abstract

The join of graphs G and H, denoted by G+H, is the graph obtained from the disjoint union of G and H by joining each vertex in G to each vertex in H. An edge uw is said to be subdivided if uw is replaced by the path P:uvw, where v is the new vertex. A graph obtained by subdividing each edge of a graph G is called the subdivision of G, and is denoted by SG. In this paper, we present results on the gracefulness of some join graphs, namely, T+Pn, T+Pnm, C4+Op, Psm+Ptn for some m,n,s,t and T is a graceful tree. We also show that the subdivision graph SKm,n of complete bipartite graph Km,n is graceful.

Suggested Citation

  • A. Panpa & P. Chaiprasert & C. Tisklang, 2025. "Graceful Labeling of some Join Graphs and the Subdivision of Complete Bipartite Graphs," Journal of Applied Mathematics, Hindawi, vol. 2025, pages 1-6, November.
    • Handle: RePEc:hin:jnljam:5533881
    DOI: 10.1155/jama/5533881
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jam/2025/5533881.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/jam/2025/5533881.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/jama/5533881?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:jnljam:5533881. 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.