Presented by: 
Abdollah Khodkar (University of West Georgia)
Date: 
Tue 24 May, 3:00 pm - 4:00 pm
Venue: 
67-442

A graph G with vertex set V and edge set E is called super edge- graceful if there is a bijection f from E to {0, ±1, ±2, . . . , ±(|E|1)/2} when |E| is odd and from E to 1,±2,..., ±|E|/2} when |E| is even such that the inducedvertex labeling f defined by f(u) =  Σf(uv) over all edges uv is a bijection from V to {0, ±1, ±2, . . . , ±(|V |1)/2} when |V | is odd and from V to 1,±2,...,±|V |/2} when |V | is even. A kite is a graph formed by merging a cycle and a path at an endpoint of the path. In this talk, we show that all kites with n 7 vertices are super edge-graceful. 

 

Joint work with Alexander Clifton, Massachusetts Institute of Technology, USA