Snakes and Caterpillars in Graceful Graphs

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Barrientos Christian; Minion Sarah

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

Journal Paper

Paper Information

Journal: JOURNAL OF ALGORITHMS AND COMPUTATION Year:2018 | Volume:50 | Issue:2 Page(s): 37-47

Download Full-Text

View:

192

Download:

194

Cites:

Information Journal Paper

Title

Snakes and Caterpillars in Graceful Graphs

Author(s)

Barrientos Christian | Minion Sarah | Issue Writer Certificate

Keywords

-labeling

graceful labeling

snake

caterpillar

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