บทคัดย่อผลงานวิจัย อาจารย์และบุคลากร มรภ.อุดรธานี

On graceful spider graphs with at most four legs of lengths greater than one

Research Project On graceful spider graphs with at most four legs of lengths greater than one
Researcher Apichai Panpa
Program Mathematics
Faculty Faculty of Science
University Udon Thani Rajabhat University
Fiscal Year 2016

 

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.