On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One
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 gracef...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2016-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2016/5327026 |
| id |
doaj-0a118f77b99f4dfda392338a237089a9 |
|---|---|
| record_format |
Article |
| spelling |
doaj-0a118f77b99f4dfda392338a237089a92020-11-24T22:43:33ZengHindawi LimitedJournal of Applied Mathematics1110-757X1687-00422016-01-01201610.1155/2016/53270265327026On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than OneA. Panpa0T. Poomsa-ard1Department of Mathematics, Faculty of Science, Udon Thani Rajabhat University, Udon Thani 41000, ThailandDepartment of Mathematics, Faculty of Science, Udon Thani Rajabhat University, Udon Thani 41000, ThailandA 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.http://dx.doi.org/10.1155/2016/5327026 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
A. Panpa T. Poomsa-ard |
| spellingShingle |
A. Panpa T. Poomsa-ard On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One Journal of Applied Mathematics |
| author_facet |
A. Panpa T. Poomsa-ard |
| author_sort |
A. Panpa |
| title |
On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One |
| title_short |
On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One |
| title_full |
On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One |
| title_fullStr |
On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One |
| title_full_unstemmed |
On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One |
| title_sort |
on graceful spider graphs with at most four legs of lengths greater than one |
| publisher |
Hindawi Limited |
| series |
Journal of Applied Mathematics |
| issn |
1110-757X 1687-0042 |
| publishDate |
2016-01-01 |
| description |
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. |
| url |
http://dx.doi.org/10.1155/2016/5327026 |
| work_keys_str_mv |
AT apanpa ongracefulspidergraphswithatmostfourlegsoflengthsgreaterthanone AT tpoomsaard ongracefulspidergraphswithatmostfourlegsoflengthsgreaterthanone |
| _version_ |
1725695215465922560 |