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, issue 1

Abstract: A graceful labeling of a tree T with n edges is a bijection f : V(T)→{0,1, 2, …, n} such that {|f(u) − f(v)| : uv ∈ E(T)} equal to {1,2, …, n}. A spider graph is a tree with at most one vertex of degree greater than 2. 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)
https://doi.org/10.1155/2016/5327026

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:wly:jnljam:v:2016:y:2016:i:1:n:5327026

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().