مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

192
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

194
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

Snakes and Caterpillars in Graceful Graphs

Pages

  37-47

Abstract

graceful labelings use a prominent place among di er-ence vertex labelings. In this work we present new fam-ilies of graceful graphs all of them obtained applying a general substitution result. This substitution is ap-plied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be analogous if the larger stable sets, in both caterpillars, have the same cardinality. We study the conditions that allow us to replace, within a gracefully labeled graph, some snakes (or paths) by anal-ogous caterpillars, to produce a new graceful graph. We present ve families of graphs where this replacement is feasible, generalizing in this way some existing results: subdivided trees, rst attachment trees, path-like trees, two-point union of paths, and armed crowns.

Multimedia

  • No record.
  • Cites

  • No record.
  • References

  • No record.
  • Cite

    APA: Copy

    Barrientos, Christian, & Minion, Sarah. (2018). Snakes and Caterpillars in Graceful Graphs. JOURNAL OF ALGORITHMS AND COMPUTATION, 50(2), 37-47. SID. https://sid.ir/paper/354560/en

    Vancouver: Copy

    Barrientos Christian, Minion Sarah. Snakes and Caterpillars in Graceful Graphs. JOURNAL OF ALGORITHMS AND COMPUTATION[Internet]. 2018;50(2):37-47. Available from: https://sid.ir/paper/354560/en

    IEEE: Copy

    Christian Barrientos, and Sarah Minion, “Snakes and Caterpillars in Graceful Graphs,” JOURNAL OF ALGORITHMS AND COMPUTATION, vol. 50, no. 2, pp. 37–47, 2018, [Online]. Available: https://sid.ir/paper/354560/en

    Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button