On edge graceful labelings of disjoint unions of 2r-regular edge graceful graphs
Adrian Riskin, Georgia Weidman
Abstract
We prove that if G is a 2r-regular edge graceful (p,q) graph with (r,kp)=1 then kG is edge graceful for odd k. We also prove that for certain specific classes of 2r-regular edge graceful graphs it is possible to drop the requirement that (r,kp)=1
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.