|
|
|
|
On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One
|
|
|
|
|
|
|
|
نویسنده
|
panpa a. ,poomsa-ard t.
|
|
منبع
|
journal of applied mathematics - 2016 - دوره : 2016 - شماره : 0
|
|
چکیده
|
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. � 2016 a. panpa and t. poomsa-ard.
|
|
|
|
|
آدرس
|
department of mathematics,faculty of science,udon thani rajabhat university,udon thani, Thailand, department of mathematics,faculty of science,udon thani rajabhat university,udon thani, Thailand
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|