On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One

A. Panpa and T. Poomsa-ard

Journal of Applied Mathematics, 2016, vol. 2016, 1-5

Abstract:

A graceful labeling of a tree with edges is a bijection such that equal to . A spider graph is a tree with at most one vertex of degree greater than . We show that all spider graphs with at most four legs of lengths greater than one admit graceful labeling.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2016/5327026.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2016/5327026.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:5327026

DOI: 10.1155/2016/5327026

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().