On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One
Joint Authors
Source
Journal of Applied Mathematics
Issue
Vol. 2016, Issue 2016 (31 Dec. 2016), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2016-11-23
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Panpa, A.& Poomsa-ard, T.. 2016. On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One. Journal of Applied Mathematics،Vol. 2016, no. 2016, pp.1-5.
https://search.emarefa.net/detail/BIM-1107220
Modern Language Association (MLA)
Panpa, A.& Poomsa-ard, T.. On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One. Journal of Applied Mathematics No. 2016 (2016), pp.1-5.
https://search.emarefa.net/detail/BIM-1107220
American Medical Association (AMA)
Panpa, A.& Poomsa-ard, T.. On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One. Journal of Applied Mathematics. 2016. Vol. 2016, no. 2016, pp.1-5.
https://search.emarefa.net/detail/BIM-1107220
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1107220
